#include <iostream>
#include <cstdio>
#include <queue>
#define N 300005
using namespace std;

int n, a[N], ans[N];
priority_queue<int> pq;
int main()
{
	int i, j, tq, t;
	cin >> n;
	for (i = 0; i < n; i++) {
		scanf("%d", &t);
		a[t]++;
	}
	for (i = 1; i <= n; i++) pq.push(-a[i]);
	for (i = n - 1; i > 0; i--) {
		tq = -pq.top(), pq.pop();
		ans[i] = tq;
        while (tq > 0) {
			t = -pq.top(), pq.pop();
			if (pq.empty() || t + tq <= -pq.top()) pq.push(-t - tq), tq = 0;
			else tq -= -pq.top() - t + 1, pq.push(pq.top() - 1);
        }
	}
	printf("%d\n", n);
	for (i = 1; i < n; i++) printf("%d\n", ans[i]);
    return 0;
}