#include<bits/stdc++.h>
#define ls rt<<1
#define rs rt<<1|1
#define mid ((l+r)>>1)
#define pii pair<int,int>
#define fi first
#define se second
using namespace std;
const int N=1e5+5;

char buf[1<<23],*p1=buf,*p2=buf;
#define getchar() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2)?EOF:*p1++)
int read(){
    int s=0,w=1;char ch=getchar();
    while(!isdigit(ch)){if(ch=='-')w=-1;ch=getchar();};
    while(isdigit(ch))s=s*10+(ch^48),ch=getchar();
    return s*w;
}

struct Tree{
    int mn,mnp;
}t[N<<2];
int a[N],mn[N],mx[N];
vector<int>vec[N],A[N],B[N];
vector<pii>cur;
int visl[N],visr[N];
int n;

void pushup(int rt){
    t[rt].mn=min(t[ls].mn,t[rs].mn);
    if(t[rt].mn==t[rs].mn)t[rt].mnp=t[rs].mnp;
    if(t[rt].mn==t[ls].mn)t[rt].mnp=t[ls].mnp;
}
void build(int l,int r,int rt){
    if(l==r)return t[rt].mnp=l,void();
    build(l,mid,ls),build(mid+1,r,rs),pushup(rt);
}
void alter(int l,int r,int rt,int id,int v){
    if(l==r)return t[rt].mn+=v,void();
    if(id<=mid)alter(l,mid,ls,id,v);
    else alter(mid+1,r,rs,id,v);
    pushup(rt);
}

signed main(){
    ios::sync_with_stdio(false);
    cin.tie(0),cout.tie(0);

    cin>>n;
    for(int i=1;i<=n;++i)
        cin>>a[i],vec[a[i]].push_back(i);
    
    if(vec[0].empty()){
        for(int i=1;i<=n;++i)putchar('1'),putchar(' ');
        return 0;
    }

    for(int i=1;i<=n;++i)
        mn[i]=n+1,mx[i]=0;

    mn[0]=1;
    for(int i=0;i<(int)vec[0].size();++i){
        int x=vec[0][i];
        cur.push_back(pii(x,x));
        if(i)
            mx[0]=max(mx[0],x-vec[0][i-1]-1);
        else mx[0]=max(mx[0],x-1);
    }
    mx[0]=max(mx[0],n-vec[0].back());

    for(int v=1;v<=n;++v){
        
        // cerr<<"v: "<<v<<endl;

        // for(auto it:cur)
        //     cerr<<it.fi<<" "<<it.se<<endl;

        vector<pii>nex;

        auto insert=[&](int l,int r){
            nex.push_back(pii(l,r));
        };

        for(auto it:cur) {
            int l=it.fi,r=it.se;
            
            if(visl[l]==v||visr[r]==v)continue;
            visl[l]=visr[r]=v;

            auto t=lower_bound(vec[v].begin(),vec[v].end(),l);
            if(t==vec[v].end()) continue;

            if(*t<=r){
                insert(l,r);
                continue;
            }

            int L=n+1,R=0;

            if(t!=vec[v].begin())
                L=*(--t),insert(L,r);
            else L=0;

            t=upper_bound(vec[v].begin(),vec[v].end(),r);
            if(t!=vec[v].end())
                R=*t,insert(l,R);
            else R=n+1;
        
            if(L<=R)
                // cerr<<l<<" "<<r<<" \\in "<<L<<" "<<R<<endl,
                mn[v]=min(mn[v],r-l+1),
                mx[v]=max(mx[v],R-L-1);
        }      

        sort(nex.begin(),nex.end(),[](pii x,pii y)
            { return x.se-x.fi<y.se-y.fi; });
        swap(cur,nex);
    }

    // cerr<<"result:\n";
    // for(int i=0;i<=n;++i)
    //     cerr<<mn[i]<<" "<<mx[i]<<endl;

    for(int i=0;i<=n;++i)
        if(mn[i]<=mx[i])
            A[mn[i]].push_back(i),
            B[mx[i]+1].push_back(i);

    build(0,n+1,1);
    for(int i=1;i<=n;++i){
        for(auto x:A[i])alter(0,n+1,1,x,1);
        for(auto x:B[i])alter(0,n+1,1,x,-1);
        cout<<t[1].mnp<<' ';
    }
    return 0;
}