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

using namespace std;

int main()
{
    int n;
    cin>>n;

    int tmp;
    vector<int> arr;
    arr.reserve(n+5);
    for(int i = 0 ; i < n+5 ; i ++)
    {
        arr.push_back(0);
    }

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

    vector<int> list;

    for(int i = 0 ; i < arr.size() ; i ++)
    {
        if( arr[i] > 0 )
        {
            // cerr<<i<<" - "<<arr[i]<<endl;
            list.push_back(arr[i]);
        }
        
    }

    sort(list.begin(), list.end());

    int liders = 0;
    int rest = 0;

    int ans = 0;

    for(int i = list.size() -1 ; i >=0 ; i -- )
    {
        liders += list[i];
        rest += list[i]-1;

        ans += 1;

        if( liders + rest >= n)
        {
            break;
        }
    }

    cout<<ans<<endl;


}