#include <bits/stdc++.h>

using namespace std;

int main() {
    int n;
    cin >> n;

    vector<int> a(n);

    unordered_map<int, int> cities;

    for (int i = 0; i < n; ++i) {
        int tmp;
        cin >> tmp;

        if (cities.find(tmp) == cities.end()) {
            cities[tmp] = 1;
        } else {
            cities[tmp]++;
        }
    }

    for (const auto& pair : cities) {
        a.push_back(pair.second);
    }

    std::sort(a.begin(), a.end(), greater<int>());

    for (int k = 1; k <= n; ++k) {
        int res = 0;
        for (int i = 0; i < a.size(); ++i) {
            if (a[i] < k) {
                break;
            } else {
                res += a[i] - a[i] % k;
            }
        }
        cout << res << " ";
    }

}