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
#include <bits/stdc++.h>
#define int long long
#define pii pair<int,int>
#define all(x) x.begin(),x.end()
#define vi vector<int>
#define vb vector<bool>
#define vii vector<pii>
#define siz(x) (int)x.size()
#define pb push_back
#define st first
#define nd second
#define rep(i,a,b) for(int i=a; i<=b; i++)
using namespace std;
const int inf = 1e9, maxn = 1e6, mod = 1e9+7;

int32_t main(){
    ios_base::sync_with_stdio(0);cin.tie(0);
    int n;
    cin>>n;
    map<int,int>M;
    rep(i,1,n){
        int a;cin>>a;
        M[a]++;
    }
    vi V;
    for(auto [a,b] : M)
        V.pb(b);
    sort(all(V));reverse(all(V));
    deque<int>Q;
    for(auto w : V)Q.pb(w);
    int ans = 0;
    while(siz(Q)){
        int akt = Q.front();
        ans++;
        Q.pop_front();
        while(akt && siz(Q)){
            if(Q.back()<akt){
                akt-=Q.back();
                Q.pop_back();
            }else{
                Q.back()-=(akt-1);
                akt = 0;
            }
            
        }
    }
    cout<<ans;
}