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 <bits/stdc++.h>
using namespace std;
 
#ifdef DEBUG
auto &operator<<(auto &o, pair<auto, auto> p) {
    return o << "()" << p.first << ", " << p.second <<")";
}
auto operator<<(auto &o, auto x)-> decltype(x.end(), o) {
    o << "{";int i = 0;
    for(auto e : x) o << ", "+!i++<<e;
    return o <<"}";
}
#define debug(x...) cerr << "["#x"]: ",[](auto...$){((cerr<<$<<"; "),...)<<endl;}(x)
#else
#define debug(...) {}
#endif
 
#define int long long
#define all(x) x.begin(), x.end()
#define pb push_back
#define fi first
#define se second
typedef pair <int, int> pii;
 
void test() {
    int n; cin>>n;
    map <int, int> M;
    
    for (int i=0; i<n; ++i) {
        int x; cin>>x;
        M[x]++;
    }
    vector <int> cnt;
    for (auto &[x, y] : M) {
        cnt.pb(y);
    }

    sort(all(cnt));
    reverse(all(cnt));
    debug(cnt);
    vector <int> res(n+1);

    for (int i=1; i<=n; ++i) {
        for (int j=0; j<cnt.size(); ++j) {
            if (cnt[j] / i == 0) {
                break;
            }
            debug(i, j,  (cnt[j]/i) * i);
            res[i] += (cnt[j]/i)*i;
        }
    }

    for (int i=1; i<=n; ++i) {
        cout<<res[i]<<' ';
    }
}
 
signed main() {
  ios_base::sync_with_stdio(0); cin.tie(0);
  int t = 1; 
  while (t--) {
    test();
  }
}