#include <iostream>
#include <algorithm>
using namespace std;
const int mx = 5e5+5;

int n, x;
int counter[mx];

int main(){
    ios::sync_with_stdio(false);

    cin >> n;
    for(int i = 0; i < n; ++i){
        cin >>x;
        ++ counter[x];
    }

    sort(counter+1, counter+n+1);

    int ans = 0;
    int left = 1;
    int right = n;

    while(left <= right){
        ++ans;
        if(left == right)
            break;

        int total = counter[right];

        while(left < right){
            int actual = counter[left];

            if(total > actual){
                total -= actual;
                ++left;
            }
            else{
                counter[left] -= (total-1);
                break;
            }
        }
        -- right;
    }
    cout << ans;

    return 0;
}