// #include <bits/stdc++.h>
#define FAST ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0);
#include <iostream>
#include <unordered_map>
using namespace std;
int gcd(int a, int b) { return b ? gcd(b, a%b) : a; }

void solve()
{
}

int main()
{
    FAST
    int n;
    cin >> n;
    unordered_map<uint64_t, int> m;
    uint64_t tmp;
    for (int i = 0; i < n; i++)
    {
        cin >> tmp ;
        m[tmp]++;
    }
    int max = 0;
    unordered_map<int, int> sum_m;
    for (auto v: m) {
        sum_m[v.second]++;
        if (v.second > max) {
            max = v.second;
        }
    }
    
    int sum;
    for (int i = 1 ; i <= n ; i++) {
        if (i > max) {
            cout << 0 << " ";
            continue;
        }
        sum = 0;
        for (auto v : sum_m) {
            sum +=(v.first/i)*v.second;
        }
        sum *= i;
        cout << sum<< " ";
    }
}