#include <bits/stdc++.h>

using namespace std;

int a[500500];
int c[500500];

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

    int n;
    cin >> n;

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

    vector<int> cs;
    for(int i = 0; i <= n; i++) {
        if(c[i]) {
            cs.push_back(c[i]);
        }
    }

    sort(cs.begin(), cs.end(), greater<>());

    int p = 0;
    int q = cs.size() - 1;
    while(1) {
        if(p == q) {
            break;
        }

        if(cs[p] == 1) {
            p++;
            continue;
        }

        int sub = min(cs[p] - 1, cs[q]);
        cs[p] -= sub;
        cs[q] -= sub;

        if(!cs[q]) {
            cs.pop_back();
            q--;
        }
    }
    cout << cs.size() << "\n";

    return 0;
}