#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#define st first
#define nd second
typedef long long ll;
using namespace std;

int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    int n; cin >> n;
    vector<int> count(n+1);
    for (int i = 0; i < n; i++) {
        int x; cin >> x;
        count[x]++;
    }
    vector<pair<int, int>> order(n+1);
    for (int i = 1; i <= n; i++) order[i] = {count[i], i};
    sort(order.begin(), order.end());
    int ans = 0;
    int left = n;
    for (int i = n; i >= 0; i--) {
        int b = order[i].st;
        ans++;
        left -= b+b-1;
        if (left <= 0) break;
    }
    cout << ans << '\n';
}