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
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define int long long
#define st first
#define nd second
#define pb push_back
#define mp make_pair
#define rep(i,a,b) for(ll i=(ll)a;i<=(ll)b;++i)
#define all(a) a.begin(),a.end()
#define sz(x) (int)(x).size()
const int mxN = 5e5+7;
int cnt[mxN];

int32_t main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    int n; cin >> n;
    rep(i,1,n){
        int x; cin >> x;
        cnt[x]++;
    }

    vector<int> v;
    rep(i,1,n) if(cnt[i]) v.pb(cnt[i]);
    sort(all(v));
    reverse(all(v));

    int akt = 0;

    rep(i,0,sz(v)-1){
        n -= v[i];
        akt += v[i];
        if(akt - (i + 1) >= n){
            cout << i+1 << "\n";
            return 0;
        }
    }
}