// #pragma GCC target("avx2")
// #pragma GCC optimize("O3")
// #pragma GCC optimize("unroll-loops")


#include<bits/stdc++.h>
using namespace std;
using uint = unsigned int;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
template<class T> using V = vector<T>;
template<class T> using VV = V<V<T>>;
template<class T> using VVV = V<VV<T>>;
template<class T> using VVVV = VV<VV<T>>;
#define rep(i,n) for(ll i=0ll;(i)<(n);(i)++)
#define REP(i,a,n) for(ll i=(a);(i)<(n);(i)++)
#define rrep(i,n) for(ll i=(n)-1;(i)>=(0ll);(i)--)
#define RREP(i,a,n) for(ll i=(n)-1;(i)>=(a);(i)--)
const long long INF = (1LL << 60);
const long long mod99 = 998244353;
const long long mod107 = 1000000007;
const long long mod = mod99;
#define eb emplace_back
#define be(v) (v).begin(),(v).end()
#define all(v) (v).begin(),(v).end()
#define foa(i,v) for(auto& (i) : (v))
#define UQ(v) sort(be(v)), (v).erase(unique(be(v)), (v).end())
#define UQ2(v,cmp) sort(be(v)), (v).erase(unique(be(v),cmp), (v).end())
#define UQ3(v,cmp) sort(be(v),cmp), (v).erase(unique(be(v)), (v).end())
#define UQ4(v,cmp,cmp2) sort(be(v), cmp), (v).erase(unique(be(v),cmp2), (v).end())
#define LB(x,v) (lower_bound(be(v),(x))-(v).begin())
#define LB2(x,v,cmp) (lower_bound(be(v),(x),(cmp))-(v).begin())
#define UB(x,v) (upper_bound(be(v),(x))-(v).begin())
#define UB2(x,v,cmp) (upper_bound(be(v),(x),(cmp))-(v).begin())
#define dout()  cout << fixed << setprecision(20)
#define randinit() srand((unsigned)time(NULL))

template<class T, class U> bool chmin(T& t, const U& u) { if (t > u){ t = u; return 1;} return 0; }
template<class T, class U> bool chmax(T& t, const U& u) { if (t < u){ t = u; return 1;} return 0; }


ll Rnd(ll L=0, ll R=mod99){return rand()%(R-L)+L;}



void solve(){
    ll n;
    cin >> n;
    V<ll> v(n);
    rep(i,n) cin >> v[i], v[i]--;
    
    ll M = 320;
    V<ll> l(M+20, n), r(M+20, n);
    l[0] = 0;
    V<ll> ans(n+1, -1);
    {
        VV<ll> cnt(M+20, V<ll>(n, 0));
        V<ll> ki(M+20, 0);
        for(auto x:v){
            cnt[0][x] ++;
            if(cnt[0][x] == 1) ki[0]++;
        }
        for(ll i=n; i>=M; i--){
            rep(j, M+10){
                while(ki[j] > i){
                    r[j]--;
                    l[j+1]--;
                    cnt[j][v[r[j]]] --;
                    cnt[j+1][v[r[j]]] ++;
                    if(cnt[j][v[r[j]]] == 0) ki[j] --;
                    if(cnt[j+1][v[r[j]]] == 1) ki[j+1]++;
                }
            }
            // cout << i << endl;
            ans[i] = LB(n, l);
        }
    }
    
    
    
    V<ll> cnt(n, 0);
    REP(i,1,min(M+1, n+1)){
        cnt.assign(n, 0);
        ll last = 0;
        ll a = 1;
        queue<ll> que;
        rep(j, n){
            cnt[v[j]] ++;
            if(cnt[v[j]] == 1){
                que.push(v[j]);
            }
            if(que.size() > i){
                while(!que.empty()){
                    cnt[que.front()] = 0;
                    que.pop();
                }
                a++;
                last = j;
                cnt[v[j]] = 1;
                que.push(v[j]);
            }
        }
        ans[i] = a;
    }
    REP(i, 1, n+1) cout << ans[i] << '\n';
    
    
}

int main(){
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    int t=1;
    // cin >> t;
    rep(i,t) solve();
}