/*
[templates]: 
duipai
compre
addhis
floor_sum
matrix
network_flow
polynomial
lca
bitset
valuesgt
fenwick
erbitree
segment
mcmf
primal_dual
centroid
add0cnt
euler
basis
*/
//#pragma GCC optimize("Ofast")
//#pragma GCC target("avx")
#include<bits/stdc++.h>
using namespace std;
#define int long long
//use ll instead of int.
#define f(i, a, b) for(int i = (a); i <= (b); i++)
#define cl(i, n) i.clear(),i.resize(n);
#define endl '\n'
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const int inf = 1e18;
//#define cerr if(false)cerr
//#define freopen if(false)freopen
mt19937 rng(std::chrono::high_resolution_clock::now().time_since_epoch().count()); 
int rnd(int l, int r) {return rng() % (r-l+1) + l; }
#define watch(x) cerr  << (#x) << ' '<<'i'<<'s'<<' ' << x << endl
void pofe(int number, int bitnum) {
    string s; f(i, 0, bitnum) {s += char(number & 1) + '0'; number >>= 1; } 
    reverse(s.begin(), s.end()); cerr << s << endl; 
    return;
}
double runtime() {return 1.0*clock()/CLOCKS_PER_SEC;}
template <typename TYP> void cmax(TYP &x, TYP y) {if(x < y) x = y;}
template <typename TYP> void cmin(TYP &x, TYP y) {if(x > y) x = y;}
//调不出来给我对拍！
//use std::array.
const int N=1e5; 
int a[N+10]; int nxt[N+10],cur[N+10]; 
int sgt[4*N+10]; 
void add(int now,int l,int r,int x,int k) {
    if(l==r) {sgt[now] += k;return; }
    int mid=(l+r)>>1; if(x<=mid) add(now*2,l,mid,x,k);
    else add(now*2+1,mid+1,r,x,k);
    sgt[now]=min(sgt[now*2],sgt[now*2+1]); 
}
int erfen(int now,int l,int r) {
    if(l==r) {return l;}
    int mid=(l+r)>>1;
    if(sgt[now*2]>0)return erfen(now*2+1,mid+1,r);
    else return erfen(now*2,l,mid); 
}
struct qj {
    int l,r; int val,t; 
    bool operator< (const qj op) const {
        if(val!=op.val)return val<op.val;
        else if(l!=op.l) return l < op.l; else return r<op.r; 
    }
};
struct rect {
    int t,u; int l,r; int val; 
}; vector<rect> rec; //这个可以卡常不显式存. 
set<qj> kdl;

void eli(int b) {
    vector<qj> er,in;
    for(auto it:kdl) {
        if(it.l<b) {
            if(it.r<b) {
                rec.push_back({it.l,it.r,it.t,b-1,it.val});
                er.push_back(it);   
            }
            else {
                rec.push_back({it.l,b-1,it.t,b-1,it.val});
                er.push_back(it); 
                in.push_back({b,it.r,it.val,it.t});  
                break; 
            }
        }
        else break;
    }
    for(auto it:er) kdl.erase(it);
    for(auto it:in) kdl.insert(it);  
}
void emin(int b, int u, int q)  {
    if(b>u)return;
    vector<qj> er,in;int tp=inf; 
    auto fr=kdl.lower_bound({0,0,q+1,0}); 
    for(auto jt=fr;jt!=kdl.end();jt++) {
        auto it=*jt;
        if(it.l > u) {
            break; 
        }
        else {
            if(it.val > q) {
                cmin(tp,it.l); 
                er.push_back(it); 
                if(it.r > u) {
                    rec.push_back({it.l,u,it.t,b-1,it.val});
                    in.push_back({u+1,it.r,it.val,it.t});
                    break;  
                }
                else {
                    rec.push_back({it.l,it.r,it.t,b-1,it.val}); 
                }
            }
        }
    }
    for(auto it:er) kdl.erase(it);
    for(auto it:in) kdl.insert(it);  
    if(tp<=u)kdl.insert({tp,u,q,b}); 
}
vector<int> in[N+10], out[N+10]; 
void print() {
    cerr<<"Print\n"; 
    for(auto it:kdl) {
        cerr<<"["<<it.l<<", "<<it.r<<"], val="<<it.val<<", time="<<it.t<<endl;
    }
    cerr<<"------------------------\n";
}
signed main() {
    ios::sync_with_stdio(0);
    cin.tie(NULL);
    cout.tie(NULL);
    // freopen("P9970.in","r",stdin);
    // freopen("P9970.out","w",stdout);
    // freopen("P9970.ear","w",stderr);
    //time_t start = clock();
    //think twice,code once.
    //think once,debug forever.
    int n; cin >> n;
    f(i,1,n) cin >> a[i]; 
    f(i,0,n) cur[i]=n+1; 
    for(int i=n;i>=1;i--) {nxt[i]=cur[a[i]]; cur[a[i]]=i; }
    f(i,1,n) {
        add(1,0,n,a[i],1); kdl.insert({i,i,erfen(1,0,n),1}); 
    }
    // cerr<<runtime()<<endl;
    // print(); 
    for(int l=2;l<=n+1;l++) {
        int u=a[l-1];
        //[l, nxt[u]-1] cmin u.
        //less than l quit. 
        eli(l); 
        // print();
        emin(l, nxt[l-1]-1, u);  
        // print();
    }
    // cerr<<runtime()<<endl;
    for(auto it:rec) {
        // cerr<<"rect: "<<it.l<<" "<<it.r<<" "<<it.t<<" "<<it.u<<", val="<<it.val<<endl;
        // cerr<<"range: "<<it.t-it.r+1<<" ~ "<<it.u-it.l+1<<endl;
        out[it.u-it.l+1+1].push_back(it.val);
        in[it.t-it.r+1].push_back(it.val);  
    }   
    f(i,1,4*n+4) sgt[i]=0;
    f(i,1,n) {
        for(int j:in[i]) {
            add(1,0,n,j,1); 
        }   
        for(int j:out[i]) {
            add(1,0,n,j,-1);
        }
        cout<<erfen(1,0,n)<<" ";
    }
    cout<<endl;
    //time_t finish = clock();
    //cout << "time used:" << (finish-start) * 1.0 / CLOCKS_PER_SEC <<"s"<< endl;
    return 0;
}