#include <algorithm>
#include <iostream>
#include <unordered_map>
#include <vector>

using namespace std;

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    int n;
    cin >> n;
    unordered_map<int, int> m;
    for (int i = 0; i < n; i++) {
        int x;
        cin >> x;
        m[x]++;
    }
    vector<int> counts;
    for (auto& entry : m) {
        counts.push_back(entry.second);
    }
    sort(counts.begin(), counts.end());
    vector<pair<int, int>> cntNum;  // counts of element, num of occurances
    int lastel = counts[0];
    int num = 1;
    for (int i = 1; i < counts.size(); i++) {
        if (lastel == counts[i]) {
            num++;
        } else {
            cntNum.push_back({lastel, num});
            lastel = counts[i];
            num = 1;
        }
    }
    cntNum.push_back({lastel, num});

    for (int i = 1; i <= n; i++) {
        if (cntNum.back().first < i) {
            cout << 0 << ' ';
            continue;
        }
        int res = 0;
        for (int j = 0; j < cntNum.size(); j++) {
            res += (cntNum[j].first / i) * i * cntNum[j].second;
        }
        cout << res << ' ';
    }
}