#include <bits/stdc++.h>
using namespace std;

int n, a, res, lIdx, rIdx;
unordered_map<int, int> counts;
vector<int> countSeq;

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

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

    for(const auto& entry : counts)
    {
        countSeq.push_back(entry.second);
    }
    sort(countSeq.begin(), countSeq.end());

    rIdx = countSeq.size()-1;

    /*for(int x : countSeq)
    {
        cout << x << ' ';
    }
    cout << endl;*/

    do
    {
        int needed = countSeq[rIdx] - 1;
        ++res;

        while(needed > 0 && lIdx < rIdx)
        {
            int toTake = min(needed, countSeq[lIdx]);
            needed -= toTake;
            countSeq[lIdx] -= toTake;

            if(countSeq[lIdx] == 0)
            {
                ++lIdx;
            }
        }

        --rIdx;
    } while(lIdx <= rIdx);

    cout << res << endl;

    return 0;

}