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
#include <iostream>
#include <vector>
#include <set>
#include <map>
#include <unordered_map>
#include <algorithm>


using namespace std;

#define pb push_back
#define mp make_pair
#define st first
#define nd second
#define x first
#define y second

typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<ll> vll;

int main(){
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    
    int n;
    cin >> n;

    vll a;
    vll c;
    unordered_map<ll, int> f;

    for(int i=0; i<n; i++){
        ll ai;
        cin >> ai;
        f[ai]++;
        if(f[ai]==1){
            a.pb(ai);
        }
    }

    for(auto x: a){
        c.pb(f[x]);
    }

    sort(c.begin(), c.end(), greater<int>());

    for(int i=1; i<=n; i++){
        int ans=0;
        for(auto ci: c){
            if(ci>=i){
                ans += (ci/i)*i;
            }else{
                break;
            }
        }
        cout << ans << " ";
    }
    cout << "\n";

    return 0;
}