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
#include <bits/stdc++.h>
#include <bits/extc++.h>

using namespace std;
using namespace __gnu_pbds;

#define fwd(i,a,b) for(int i=(a); i<(b);i++)
#define rep(i,n) for(int i=0; i<(n);i++)
#define ford(i,a,b) for(int i=(a); i>(b);i--)

#define all(X) (X).begin(), (X).end()
#define sz(X)((int)(X).size())

#define st first
#define nd second

#define DEBUG
#ifdef DEBUG
template<typename T1, typename T2> auto& operator<<(ostream& out, const pair<T1, T2>& a) { return out << "(" << a.first << ", " << a.second << ")"; }
template<typename T, typename N> auto& operator<<(N& out, const T& a) { out << "{"; for (const auto& b : a) out << b << ", "; return out << "}"; }
template<typename... Args> void print(Args&&... args) { (cerr << ... << args) << "\n"; }
#define debug(x...) cerr << "[" #x "]: ", print(x)
#else
#define debug(...) ;
#endif

template<typename T>
using Tree = tree <T,  null_type,  less<T>,  rb_tree_tag,  tree_order_statistics_node_update>;

typedef long long ll;
typedef long double ld;

vector<ll> divs(ll k) {
    vector<ll> res;
    for(ll i = 1; i*i<=k ; ++i) {
        if(k%i==0) {
            res.emplace_back(i);
            if (i * i != k) res.emplace_back(k / i);
        }
    }
    return res;
}

int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);

    ll n;
    cin >> n;
    map<ll,ll> mp;
    vector<ll> tab(n);
    rep(i,n) cin >> tab[i];
    rep(i,n) tab[i] = ++mp[tab[i]];
    vector<ll> ans(n+1);
    rep(i,n) {
        vector<ll> div = divs(tab[i]);
        for(auto d : div) ans[d]++;
    }
    fwd(i,1,n+1) cout << i*ans[i] << ' ';

    return 0;
}