#include <bits/stdc++.h>
using namespace std;
int n;
vector < int > v;
int t[500005];
int main()
{
    scanf("%d", &n);
    for (int i = 0; i < n; ++i)
    {
        int k;
        scanf("%d", &k);
        ++t[k];
    }
    for (int i = 0; i <= n; ++i)
    {
        if (t[i] != 0)
            v.push_back(t[i]);
    }
    sort(v.begin(), v.end());
    int x = n;
    for (int i = v.size() - 1; i > -1; --i)
    {
        x -= 2  * v[i] - 1;
        if (x <= 0)
        {
            printf("%d", v.size() - i);
            return 0;
        }
    }
}