#include <iostream>
#include <sstream>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <ctime>
#include <cstring>
#include <string>
#include <vector>
#include <stack>
#include <queue>
#include <deque>
#include <map>
#include <set>
#include <bitset>
#include <numeric>
#include <utility>
#include <iomanip>
#include <algorithm>
#include <functional>
#include <unordered_map>
using namespace std;

template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }

template<class T> vector<T> make_vec(size_t a) { return vector<T>(a); }
template<class T, class... Ts> auto make_vec(size_t a, Ts... ts) {
  return vector<decltype(make_vec<T>(ts...))>(a, make_vec<T>(ts...));
}
template<class T, class V>
typename enable_if<is_class<T>::value == 0>::type fill(T &t, const V &v) {
    t = v;
}
template<class T, class V>
typename enable_if<is_class<T>::value != 0>::type fill(T &t, const V &v){
    for (auto &e : t) fill(e, v);
}

#define COUT(x) cout << #x << " = " << (x) << " (L" << __LINE__ << ")" << endl
template<class T1, class T2> ostream& operator << (ostream &s, pair<T1,T2> P)
{ return s << '<' << P.first << ", " << P.second << '>'; }
template<class T> ostream& operator << (ostream &s, vector<T> P)
{ for (int i = 0; i < P.size(); ++i) { if (i > 0) { s << " "; } s << P[i]; } return s; }
template<class T> ostream& operator << (ostream &s, deque<T> P)
{ for (int i = 0; i < P.size(); ++i) { if (i > 0) { s << " "; } s << P[i]; } return s; }
template<class T> ostream& operator << (ostream &s, vector<vector<T> > P)
{ for (int i = 0; i < P.size(); ++i) { s << endl << P[i]; } return s << endl; }

#define EACH(i, s) for (__typeof__((s).begin()) i = (s).begin(); i != (s).end(); ++i)
template<class T> ostream& operator << (ostream &s, set<T> P)
{ EACH(it, P) { s << "<" << *it << "> "; } return s << endl; }
template<class T1, class T2> ostream& operator << (ostream &s, map<T1,T2> P)
{ EACH(it, P) { s << "<" << it->first << "->" << it->second << "> "; } return s << endl; }


int N;
map<long long, long long> ma;


int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    
    while (cin >> N) {
        ma.clear();
        for (int i = 0; i < N; ++i) {
            long long a;
            cin >> a;
            ma[a]++;
        }
        vector<long long> v;
        for (auto it : ma) v.push_back(it.second);

        sort(v.begin(), v.end());

        //COUT(v);

        long long sum = v[0];
        long long num = 1;
        deque<long long> d;

        for (int i = 1; i < v.size(); ++i) {
            // v[i] 以下が何個か
            long long low = 0, high = N+1;
            while (high - low > 1) {
                long long mid = (low + high) / 2;
                long long val;
                if (mid > d.size()) {
                    long long div = num - (mid - (int)d.size() - 1);
                    if (div <= 0) val = 1LL<<50;
                    else val = sum / div;
                }
                else val = d[(int)d.size() - mid];

                if (val >= v[i]) high = mid;
                else low = mid;
            }

            /*
            COUT("---------------");
            COUT(i);
            COUT(v[i]);
            COUT(low);
            COUT(d);
            */

            while (d.size() > low) d.pop_front();
            while (d.size() < low) {
                long long div = i - (int)d.size();
                d.push_front(sum / div);
            }
            sum += v[i];
            num = i+1 - low;

            //COUT(sum); COUT(num); COUT(d);
        }

        for (int i = 0; i < num; ++i) cout << sum / (i+1) << endl;
        for (int i = 0; i < d.size(); ++i) cout << d[i] << endl;
        for (int i = 0; i < N - num - (int)d.size(); ++i) cout << 0 << endl;       
    }
}


















Measured memory_bytes: 23152