#include <bits/stdc++.h>
using namespace std;
int MAP[500009];
queue<int> Q;
vector<int> V;
int main(){
    int N,a,d;
    cin>>N;

    for(int i=0;i<N;i++){
        cin>>a;
        if(!MAP[a]){
           Q.push(a);
        }
        MAP[a]++;
    }

    while(!Q.empty()){
        a=Q.front();
        Q.pop();
        V.push_back(MAP[a]);
    }

    sort(V.begin(),V.end());
    d=V.size();
    int ind1=d-1,s=0;
    //cout<<ind1<<endl;
    while(N>0){
        N-=2*V[ind1]-1;
        ind1--;
        s++;
    }
    cout<<s;


return 0;}