#include <bits/stdc++.h>
using namespace std;

template<class T> istream& operator >> (istream& is, vector<T>& vec) {
    for(T& x : vec) is >> x;
    return is;
}

template<class T> ostream& operator << (ostream& os, const vector<T>& vec) {
    if(vec.empty()) return os;
    os << vec[0];
    for(auto it = vec.begin(); ++it != vec.end(); ) os << ' ' << *it;
    return os;
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    int n;
    cin >> n;
    vector<int> a(n), ans(n);
    vector<bool> used(n, true);
    cin >> a;
    for(auto &&v : a) v--;
    // k のときに何分割でいけるか求める
    auto f = [&](int k){
        if(ans[k - 1]) return ans[k - 1];
        int res = 0;
        for(int l = 0, r = 0; l < n; l = r){
            int sv = 0;
            while(r < n && (sv + used[a[r]]) <= k){
                sv += used[a[r]];
                used[a[r]] = false;
                r++;
            }
            res++;
            for(int i = l; i < r; i++) used[a[i]] = true;
        }
        return res;
    };
    int cur = 1;
    while(cur * cur <= n){
        ans[cur - 1] = f(cur);
        cur++;
    }
    while(cur <= n){
        int v = f(cur);
        int ok = cur, ng = n + 1;
        while(ok + 1 < ng){
            int mid = (ok + ng) / 2;
            (f(mid) == v ? ok : ng) = mid;
        }
        while(cur <= ok){
            ans[cur - 1] = v;
            cur++;
        }
    }
    for(auto v : ans) cout << v << '\n';
}