#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <cstring>
#include <cmath>
#include <limits>
#include <stack>
#include <queue>
#include <map>
#include <set>
#include <functional>
#include <iomanip>

using namespace std;

#ifdef LOCAL
#define eprintf(...) fprintf(stderr, __VA_ARGS__)
#else
#define eprintf(...) 42
#endif
using ll = long long;
using vll = std::vector<ll>;
using vvll = std::vector<vll>;
using vvvll = std::vector<vvll>;
#define reps(i, S, E) for (ll i = (S); i <= (E); i++)
#define rep(i, N) reps(i, 0, N-1)
#define deps(i, E, S) for (ll i = (E); i >= (S); i--)
#define dep(i, N) deps(i, N-1, 0)
const ll INF = 1LL << 60;
const int INF_INT = 1 << 30;

template<class T> inline bool chmax(T &a, T b) { if (a < b) { a = b; return true; }return false; }
template<class T> inline bool chmin(T &a, T b) { if (a > b) { a = b; return true; }return false; }
struct mll {
	static ll MOD;
	ll val;
	mll(ll v = 0) : val(v % MOD) { if (val < 0) val += MOD; }
	mll operator - () const { return -val; }
	mll operator + (const mll &b) const { return val + b.val; }
	mll operator - (const mll &b) const { return val - b.val; }
	mll operator * (const mll &b) const { return val * b.val; }
	mll operator / (const mll &b) const { return mll(*this) /= b; }
	mll operator + (ll b) const { return *this + mll(b); }
	mll operator - (ll b) const { return *this - mll(b); }
	mll operator * (ll b) const { return *this * mll(b); }
	friend mll operator + (ll a, const mll &b) { return b + a; }
	friend mll operator - (ll a, const mll &b) { return -b + a; }
	friend mll operator * (ll a, const mll &b) { return b * a; }
	mll &operator += (const mll &b) { val = (val + b.val) % MOD; return *this; }
	mll &operator -= (const mll &b) { val = (val + MOD - b.val) % MOD; return *this; }
	mll &operator *= (const mll &b) { val = (val*b.val) % MOD; return *this; }
	mll &operator /= (const mll &b) {
		ll c = b.val, d = MOD, u = 1, v = 0;
		while (d) {
			ll t = c / d;
			c -= t * d; swap(c, d);
			u -= t * v; swap(u, v);
		}
		val = val * u % MOD;
		if (val < 0) val += MOD;
		return *this;
	}
	mll &operator += (ll b) { return *this += mll(b); }
	mll &operator -= (ll b) { return *this -= mll(b); }
	mll &operator *= (ll b) { return *this *= mll(b); }
	mll &operator /= (ll b) { return *this /= mll(b); }
	bool operator == (const mll &b) { return val == b.val; }
	bool operator != (const mll &b) { return val != b.val; }
	bool operator == (ll b) { return *this == mll(b); }
	bool operator != (ll b) { return *this != mll(b); }
	friend bool operator == (ll a, const mll &b) { return mll(a) == b.val; }
	friend bool operator != (ll a, const mll &b) { return mll(a) != b.val; }
	friend ostream &operator << (ostream &os, const mll &a) { return os << a.val; }
	friend istream &operator >> (istream &is, mll &a) { return is >> a.val; }
	static mll Combination(ll a, ll b) {
		chmin(b, a - b);
		if (b < 0) return mll(0);
		mll c = 1;
		rep(i, b) c *= a - i;
		rep(i, b) c /= i + 1;
		return c;
	}
};
using vmll = std::vector<mll>;
using vvmll = std::vector<vmll>;
using vvvmll = std::vector<vvmll>;
using vvvvmll = std::vector<vvvmll>;

struct Fast {
	Fast() {
		cin.tie(0);
		ios::sync_with_stdio(false);
		cout << fixed << setprecision(std::numeric_limits<double>::max_digits10);
	}
} fast; //cin,cout高速化のおまじない＋桁数指定

ll mll::MOD = (ll)(1e9 + 7);// 998244353ll;


//AtCoder Beginner Contest 143 - F (Distinct Numbers)453
vector<ll> card_count(0);
vector<ll> total(0);
ll N;

// index が条件を満たすかどうか
bool isOK(ll index, ll key) { //index:食べることができるか判定する回数 key:同時に食べる枚数k
	ll maxEat = 0;
	ll indexLB = lower_bound(card_count.begin(), card_count.end(), index) - card_count.begin();

	if (indexLB > 0) {
		maxEat += total[indexLB - 1];
	}

	maxEat += ((ll)card_count.size() - indexLB) * index;

	eprintf("index: %lld, key: %lld, indexLB: %lld, maxEat:%lld, >= %lld, %s\n", index, key, indexLB, maxEat, key * index, maxEat >= key * index ? "ok" : "ng");

	if (maxEat >= key * index) {
		return true;
	}
	else {
		return false;
	}
}

// 汎用的な二分探索のテンプレ
ll binary_search(ll key) { //k(同時に食べる枚数) = keyとしたとき、食べることができる回数を返す
	ll ng = N + 1; //「index = 0」が条件を満たすこともあるので、初期値は -1
	ll ok = -1; // 「index = a.size()-1」が条件を満たさないこともあるので、初期値は a.size()

	// ok と ng のどちらが大きいかわからないことを考慮
	while (abs(ok - ng) > 1) {
		ll mid = (ok + ng) / 2;
		if (isOK(mid, key)) ok = mid;
		else ng = mid;
	}
	return ok;
}

int main() {
	cin >> N;
	vector<ll> A(N);
	map<ll, ll> mp;
	rep(i, N) {
		cin >> A[i];
		mp[A[i]]++;
	}

	ll kind = 0;

	auto begin = mp.begin(), end = mp.end();
	for (auto iter = begin; iter != end; iter++) {
		// iter->first: key, iter->second: value
		kind++;
		card_count.push_back(iter->second);
	}

	std::sort(card_count.begin(), card_count.end());

	total.resize(kind);
	total[0] = card_count[0];
	reps(i, 1, kind - 1) {
		total[i] = total[i - 1] + card_count[i];
	}

	eprintf("card_count: ");
	rep(i, kind) {
		eprintf("%lld ", card_count[i]);
	}
	eprintf("\n");

	eprintf("total: ");
	rep(i, kind) {
		eprintf("%lld ", total[i]);
	}
	eprintf("\n");

	reps(k, 1, N) {
		ll result = binary_search(k);
		cout << result << endl;
	}

	return 0;
}


/*
vector<int> card_count(0);

int solve(int head, int last, int k) {
	if (k > card_count.size() - head) {
		//種類が足りないためゼロ
		return 0;
	}
	else if (last - card_count[head] >= card_count[head] * (k - 1)) {
		//すべて食べられる(端数除く)
		return last / k;
	}
	else {
		//再帰的に求める
		return solve(head + 1, last - card_count[head], k - 1);
	}
}

int main() {
	int N;
	cin >> N;
	vector<int> A(N);
	map<int, int> mp;
	rep(i, N) {
		cin >> A[i];
		mp[A[i]]++;
	}

	//カードの種類数kindおよび最も枚数が多い種類のカード数maxCountを求める
	int kind = 0;

	auto begin = mp.begin(), end = mp.end();
	for (auto iter = begin; iter != end; iter++) {
		// iter->first: key, iter->second: value
		kind++;
		card_count.push_back(iter->second);
	}

	std::sort(card_count.begin(), card_count.end(), std::greater<ll>());

	reps(k, 1, N) {
		cout << solve(0, N, (int)k) << endl;
	}

	return 0;
}
*/



Measured memory_bytes: 25964