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
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
#include <vector>
#include <cstdio>
#include <stack>
#include <algorithm>
#include <queue>
#include <map>
#include <cmath>
#include <unordered_set>
#include <unordered_map>
#include <set>
#include <cstring>
#include <bitset>
#include <iostream>
#include <queue>
#include <iomanip>
#include <complex>

using namespace std;

#define ALL(x) x.begin(), x.end()
#define UNIQUE(c) (c).resize(unique(ALL(c)) - (c).begin())
#define FOR(i, a, b) for(long long i =(a); i <=(b); ++i)
#define RE(i, n) FOR(i, 1, n)
#define RED(i, n) FORD(i, n, 1)
#define FORD(i, a, b) for(int i = (a); i >= (b); --i)
#define REP(i, n) for(int i = 0;i <(n); ++i)
#define REPD(i, n) FORD(i, n-1,0)


const int maxn = 500022;
const long long mod = 998244353, inf = 1000000000;
int n, il[maxn], x, res;
vector<int>v;
void solve() {
    cin>>n;
    REP(i, n){
        cin>>x;
        il[x]++;
    }
    RE(i, n)if(il[i]){
        v.push_back(il[i]);
    }
    sort(v.begin(), v.end());
    int fi = 0, la = (int)v.size() - 1;
    while (fi < la) {
        int sum = 0;
        while (sum + v[fi] < v[la]) {
            sum += v[fi++];
        }
        if(fi < la)v[fi] -= (v[la] - sum - 1);
        res ++;
        v[la] = 0;
        la --;
    }
    res += (v[fi] > 0);
    cout<<res<<"\n";
}

int main() {
    ios_base::sync_with_stdio(false), cin.tie(nullptr);
    int tt = 1;
//    cin >> tt;
    while (tt--) {
        solve();
    }
    return 0;
}