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

void input(int &n, unordered_map <int, int> &m, vector <int> &v){
    cin >> n;

    for(int i = 0; i < n; i++){
        int a;
        cin >> a;

        if(m[a] == 0){
            v.push_back(a);
        }

        m[a]++;
    }

    return;
}

void solve(int n, unordered_map <int, int> &m, vector <int> &v){
    vector <int> val;

    for(int i = 0; i < v.size(); i++){
        val.push_back(m[v[i]]);
    }

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

    int x = 0, s = 0;

    while(s < n){
        x++;

        s += (2 * val[val.size() - x] - 1);
    }

    cout << x;

    return;
}

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

    int n;
    unordered_map <int, int> m;
    vector <int> v;

    input(n, m, v);
    solve(n, m, v);

    return 0;
}