#include <iostream>
#include <vector>
#include <algorithm>

using namespace std;

int count_liders(vector<int>& a){
    sort(a.begin(), a.end());
    int i = 0, j = a.size()-1;
    
    int res = 1;

    while(i < j){
        if(!a[i]){
            i++;
            continue;
        }
        if(a[j] - a[i] > 0){
            a[j] -= a[i];
            i++;
        }
        else{
            a[i] = a[i] - a[j] + 1;
            j--;
            res++;
        }

    }
    return res;
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);

    int n; cin >> n;

    vector<int> a(n,0);
    for(int i = 0; i < n; i++){
        int tmp; cin >> tmp;
        a[tmp-1]++;
    }

    cout << count_liders(a) << endl;
    
    return 0;
}