1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
//GRT_2018
#include <bits/stdc++.h>
#define PB push_back
#define ST first
#define ND second
#define all(x) x.begin(), x.end()
//mt19937 rng(chrono::high_resolution_clock::now().time_since_epoch().count());

using namespace std;

using ll = long long;
using pi = pair<int,int>;
using vi = vector<int>;


const int nax = 500 * 1000 + 10;
int n;
int cnt[nax];

int main() {
	ios_base::sync_with_stdio(0);
	cin.tie(0);
    cin >> n;
    for (int x, i = 1; i <= n; ++i) {
        cin >> x;
        cnt[x]++;
    }
    sort(cnt + 1, cnt + n + 1);
    reverse(cnt + 1, cnt + n + 1);
    int sum = 0;
    int ans = -1;
    for (int i = 1; i <= n; ++i) {
        sum += cnt[i];
        if (sum - i >= (n - sum)) {
            ans = i;
            break;
        }
    }   
    cout << ans;
}