#include <bits/stdc++.h>

using namespace std;

typedef pair<int, int> pii;
typedef long long ll;
const int N = 2000086, MOD = 1e9 + 7, INF = 0x3f3f3f3f;
ll res;
int n, m, cnt, w[N];

struct Node {
    int l, r;
    map<int, int> ma;
}e[N];

int main() {
    cin >> n;
    for (int i = 1; i < n + 1; i++) scanf("%d", w + i);
    int sz = n;
    for (int i = 1; i < n + 1; i++) e[i].l = e[i].r = i, e[i].ma[w[i]]++;
    for (int t = 1; t < n + 1; t++) {
        int pre = 0;
        for (int i = 1; i < sz + 1; i++) {
            while (e[i].l <= pre) {
                if (e[i].ma.count(w[e[i].l])) {
                    e[i].ma[w[e[i].l]]--;
                    if (!e[i].ma[w[e[i].l]]) e[i].ma.erase(w[e[i].l]);
                }
                e[i].l++;
            }
            if (!e[i].ma.size()) e[i].r = e[i].l, e[i].ma[w[e[i].l]]++;
            while (e[i].r + 1 <= n && (e[i].ma.size() < t || e[i].ma.count(w[e[i].r + 1]))) {
                e[i].r++;
                e[i].ma[w[e[i].r]]++;
            }

            if (e[i].r == n) { sz = i; break; }
            pre = e[i].r;
        }
        printf("%d\n", sz);
    }
    return 0;
}