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
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
#include <bits/stdc++.h>
using namespace std;

#define REP(i, n) for (int i = 0; i < (int)n; i++)
#define ST first
#define ND second
#define MP make_pair
#define PB push_back

typedef vector<int> VI;
typedef pair<int, int> PII;
typedef vector<PII> VPII;
typedef set<int> SI;
typedef long long LL;

#ifdef DEBUG
const bool debug = true;
#else
const bool debug = false;
#endif

// #define MULTI_TASK true

const int INF = 1000 * 1000 * 1000;
const LL INFLL = 1e18;
const int MAKSN = 1000 * 1000 + 13;
const LL MOD = 123456789LL;
LL N, M, k, l, a, b, c, d;
VPII v;
map<int, int> counter, counter2;


void zeruj() {
    v.clear();
}

void readIn() {
    cin >> N;
    REP(i, N) {
        cin >> k;
        counter[k] += 1;
    }

    for (auto x: counter) {
        counter2[x.ND] += 1;
    }

    for (auto x: counter2) {
        v.PB({x.ST, x.ND});
    }

    sort(v.begin(), v.end());
    reverse(v.begin(), v.end());
}


void solve() {
    for (int i = 1; i <= N; i++) {
        int ans = 0;
        for (int j = 0; j < (int) v.size(); j++) {
            ans += (v[j].ST / i) * i * v[j].ND;
        }

        while (!v.empty() && v.back().ST <= i) {
            v.pop_back();
        }
        cout << ans << " ";
    }
}

int main() {
    ios_base::sync_with_stdio(0);
#ifdef MULTI_TASK
    int test;
    cin >> test;
    while (test--) {
#endif
        zeruj();
        readIn();
        solve();
#ifdef MULTI_TASK
    }
#endif
    return 0;
}