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

int n, i, j, a, temp, res;
std::vector<int> vec;

int main()
{
    std::ios_base::sync_with_stdio(0);
    std::cin.tie(0);

    std::cin >> n;

    for (i = 0; i < n + 1; i++)
    { vec.push_back(0); }
    
    for (i = 0; i < n; i++)
    {
        std::cin >> a;
        vec[a]++;
    }

    std::sort(vec.begin(), vec.end());

    res = 0;
    for (int i = vec.size() - 1; i >= j; i--)
    {
        res++;
        if (i == j) break;
        temp = vec[i] - 1;
        while (temp > 0)
        {
            if (vec[j] > temp)
            {
                vec[j] -= temp;
                temp = 0;
                break;
            }
            vec[j] == 0;
            temp -= vec[j];
            j++;
        }
    }
    
    std::cout << res;

    return 0;
}