#include<bits/stdc++.h>
#define pi pair<int,int>
#define N 100005
using namespace std;
void in(int &x){
    x=0;int f=1;char c=getchar();
    while((c!='-')&&(c>'9'||c<'0'))c=getchar();
    if(c=='-')f=-1,c=getchar();
    while(c<='9'&&c>='0')x=x*10+c-'0',c=getchar();
    x*=f; 
}
int t,n,m,k,x,y,xx,yy,z,w,a[1000005],b[1000005],L[500005],R[500005],res[500005];
char ss[1000005];
vector<int>g[500005];
int tot,rt[200005],ls[5000005],rs[5000005],val[5000005];
void ins(int l,int r,int &id,int q,int k){
    tot++;ls[tot]=ls[id];rs[tot]=rs[id];id=tot;
    if(l==r){val[id]=k;return;}
    int mid=(l+r)/2;
    if(q<=mid)ins(l,mid,ls[id],q,k);
    else ins(mid+1,r,rs[id],q,k);
    val[id]=min(val[ls[id]],val[rs[id]]);
}
int mex(int u,int l,int r,int x){
    if(!u||l==r)return l;
    int mid=(l+r)/2;
    if(val[ls[u]]>=x)return mex(rs[u],mid+1,r,x);
    else return mex(ls[u],l,mid,x);
}
struct node{
    int l,r;
    mutable int v;
    bool operator <(const node &a)const{return l!=a.l?l<a.l:r<a.r;}
};
set<node>s;
vector<int>Ins[200005],del[200005];
int sum[500005],siz[500005];
void pushup(int x){siz[x]=siz[x<<1]+siz[x<<1|1];}
void upd(int l,int r,int id,int q,int k){
    if(l==r){sum[id]+=k;siz[id]=(sum[id]>=1);return;}
    int mid=(l+r)/2;
    if(q<=mid)upd(l,mid,id<<1,q,k);
    else upd(mid+1,r,id<<1|1,q,k);
    pushup(id);
}
int query(int l,int r,int id){
    if(l==r)return l;
    int mid=(l+r)/2;
    if(siz[id<<1]==mid-l+1)return query(mid+1,r,id<<1|1);
    else return query(l,mid,id<<1);
}
signed main(){
    in(n);
    memset(L,-0x3f,sizeof L);memset(R,-0x3f,sizeof R);
    for(int i=1;i<=n;i++)in(a[i]),g[a[i]].push_back(i);
    for(int i=1;i<=n;i++)rt[i]=rt[i-1],ins(0,n,rt[i],a[i],i);
    for(int i=1;i<=n;i++){
        if(i==1)s.insert({1,1,0}),L[0]=R[0]=1;
        else{
            node lst=*(prev(s.end()));
            if((lst.v)==0)s.insert({lst.l,i,0}),R[0]=i,s.erase(lst);
            else s.insert({i,i,0}),L[0]=R[0]=i;
        }
        if(L[a[i]]>0){
            int l=L[a[i]],r=R[a[i]],v=a[i];
            s.erase({l,r,v});L[a[i]]=R[a[i]]=-1e9;
            while(r>=l){
                v=mex(rt[i],0,n,r);
                auto it=upper_bound(g[v].begin(),g[v].end(),r);
                if(it==g[v].begin()||(x=*(prev(it)))<l){
                    if(R[v]!=l-1){
                        s.insert({l,r,v});
                        L[v]=l;R[v]=r;
                    }
                    else{
                        s.erase({L[v],R[v],v});R[v]=r;
                        s.insert({L[v],R[v],v});
                    }
                    break;
                }
                s.insert({x+1,r,v});
                L[v]=x+1;R[v]=r;r=x;
            }
        }
        for(auto [l,r,v]:s){
            //[i-r+1,i-l+1]:v
            Ins[i-r+1].push_back(v);
            del[i-l+2].push_back(v);
        }
    }
    for(int i=1;i<=n;i++){
        for(int x:Ins[i])upd(0,N,1,x,1);
        for(int x:del[i])upd(0,N,1,x,-1);
        printf("%d ",query(0,N,1));
    }
}