//#pragma GCC optimize("Ofast")
//#pragma GCC target("avx")
//#undef LOCAL
#include <bits/stdc++.h>

using namespace std;
using uint = unsigned int;
using ll = long long;
using ull = unsigned long long;
constexpr ll TEN(int n) { return (n == 0) ? 1 : 10 * TEN(n - 1); }
template <class T> using V = vector<T>;
template <class T> using VV = V<V<T>>;

#ifdef LOCAL
struct PrettyOS {
    ostream& os;
    bool first;
    template <class T> auto operator<<(T&& x) {
        if (!first) os << ", ";
        first = false;
        os << x;
        return *this;
    }
};
template <class... T> void dbg0(T&&... t) {
    (PrettyOS{cerr, true} << ... << t);
}
#define dbg(...)                                            \
    do {                                                    \
        cerr << __LINE__ << " : " << #__VA_ARGS__ << " = "; \
        dbg0(__VA_ARGS__);                                  \
        cerr << endl;                                       \
    } while (false);
#else
#define dbg(...)
#endif

template <class T, class U>
ostream& operator<<(ostream& os, const pair<T, U>& p) {
    return os << "P(" << p.first << ", " << p.second << ")";
}

template <class T> ostream& operator<<(ostream& os, const V<T>& v) {
    os << "[";
    for (auto d : v) os << d << ", ";
    return os << "]";
}

struct Scanner {
    FILE* fp = nullptr;
    char line[1<<15];
    size_t st = 0, ed = 0;
    void reread() {
        memmove(line, line + st, ed - st);
        ed -= st;
        st = 0;            
        ed += fread(line + ed, 1, (1<<15) - ed, fp);
    }
    void succ() {
        while (true) {
            if (st == ed) reread();
            while (st != ed && isspace(line[st])) st++;
            if (st != ed) break;
        }
        if (ed - st <= 50) reread();
    }
    template <class T, enable_if_t<is_integral<T>::value, int> = 0>
    bool read_single(T& ref) {
        succ();
        bool neg = false;
        if (line[st] == '-') {
            neg = true;
            st++;
        }
        ref = T(0);
        while (isdigit(line[st])) {
            ref = 10 * ref + (line[st++] - '0');
        }
        if (neg) ref = -ref;
        return true;
    }
    void read() {}
    template <class H, class... T>
    void read(H& h, T&... t) {
        bool f = read_single(h);
        assert(f);
        read(t...);
    }
    Scanner(FILE* _fp) : fp(_fp) {}
};


struct Printer {
    static constexpr size_t SIZE = 1 << 15;
    FILE* fp;
    char line[SIZE], small[50];
    size_t pos = 0;
    void flush() {
        fwrite(line, 1, pos, fp);
        pos = 0;
    }
    void write_single(const char& ref) {
        if (pos == SIZE) flush();
        line[pos++] = ref;
    }
    template <class T, enable_if_t<is_same<T, string>::value, int> = 0>
    void write_single(const T& ref) {
        for (char c: ref) write_single(c);
    }
    template <class T, enable_if_t<is_integral<T>::value, int> = 0>
    void write_single(T ref) {
        if (pos > (1 << 15) - 50) flush();
        if (ref == 0) {
            write_single('0');
            return;
        }
        if (ref < 0) {
            write_single('-');
            ref = -ref; // todo min
        }
        size_t len = 0;
        while (ref) {
            small[len++] = char('0' + (ref % 10));
            ref /= 10;
        }
        reverse(small, small + len);
        memcpy(line + pos, small, len);
        pos += len;
    }
    template <bool F>
    void writeln() { write_single('\n'); }
    template <bool F = false, class H, class... T> void writeln(const H& h, const T&... t) {
        if (F) write_single(' ');
        write_single(h);
        writeln<true>(t...);
    }
    Printer(FILE* _fp) : fp(_fp) {}
    ~Printer() { flush(); }
};

int main() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    cout << fixed << setprecision(20);
    Scanner sc(stdin);
    Printer pr(stdout);
    int n;
    sc.read(n);    
    V<int> freq(n);
    for (int i = 0; i < n; i++) {
        int a;
        sc.read(a); a--;
        freq[a]++;
    }
    sort(freq.begin(), freq.end());
    V<int> fsm(n + 1);
    for (int i = 0; i < n; i++) {
        fsm[i + 1] = fsm[i] + freq[i];
    }


    for (int k = 1; k <= n; k++) {
        int lw = 0, up = n + 1;
        while (up - lw > 1) {
            int md = (lw + up) / 2;
            int idx = lower_bound(freq.begin(), freq.end(), md) - freq.begin();
            int u = fsm[idx] + (n - idx) * md;
            if (u >= ll(md) * k) lw = md;
            else up = md;
        }
        pr.writeln(lw);
    }

    dbg(freq);


    return 0;
}


Measured memory_bytes: 3328