#include <bits/stdc++.h>
using namespace std;
int trips(int weight[],int num){
unordered_map<int,int>w;
int count=0;
for(int i=0;i<num;i++){
w[weight[i]]++;
}
for(int i=0;i<num;i++){
if(w[weight[i]]%3==0){
count++;
}
else{
count+=w[i]/3+1;
}
}
return count;
}
int main() {
// your code goes here
int n;
cin>>n;
int packageWeight[n];
for(int i=0;i<n;i++){
cin>>packageWeight[i];
}
cout<<"the minimum number of trips are:"<<trips(packageWeight,n);
return 0;
}
I2luY2x1ZGUgPGJpdHMvc3RkYysrLmg+CnVzaW5nIG5hbWVzcGFjZSBzdGQ7CmludCB0cmlwcyhpbnQgd2VpZ2h0W10saW50IG51bSl7Cgl1bm9yZGVyZWRfbWFwPGludCxpbnQ+dzsKCWludCBjb3VudD0wOwoJZm9yKGludCBpPTA7aTxudW07aSsrKXsKCQl3W3dlaWdodFtpXV0rKzsKCX0KCWZvcihpbnQgaT0wO2k8bnVtO2krKyl7CgkJaWYod1t3ZWlnaHRbaV1dJTM9PTApewoJCQljb3VudCsrOwoJCX0KCQllbHNlewoJCQljb3VudCs9d1tpXS8zKzE7CgkJfQoJfQoJcmV0dXJuIGNvdW50OwogCn0KIAppbnQgbWFpbigpIHsKCS8vIHlvdXIgY29kZSBnb2VzIGhlcmUKCWludCBuOwoJY2luPj5uOwoJaW50IHBhY2thZ2VXZWlnaHRbbl07Cglmb3IoaW50IGk9MDtpPG47aSsrKXsKCQljaW4+PnBhY2thZ2VXZWlnaHRbaV07Cgl9Cgljb3V0PDwidGhlIG1pbmltdW0gbnVtYmVyIG9mIHRyaXBzIGFyZToiPDx0cmlwcyhwYWNrYWdlV2VpZ2h0LG4pOwoJcmV0dXJuIDA7Cn0=