#include<bits/stdc++.h>
using namespace std;
int n,l[200005],r[200005],ans[200005],a[200005];
int stk[200005],top=0;
void solve(){
    a[n+1]=-1;
    for(int i=1;i<=n+1;i++){
        if(top==0||a[stk[top-1]]<a[i]){
            l[i]=i;
            stk[top++]=i;
        }
        else if(a[stk[top-1]]==a[i]) continue;
        else{
            while(top>0&&a[stk[top-1]]>a[i]){
                top--;
                int len=i-l[stk[top]];
                ans[len]=max(ans[len],a[stk[top]]);
            }
            if(top==0) l[i]=1;
            else l[i]=l[stk[top]];
            stk[top++]=i;
        }
    }
    for(int i=n-1;i>=1;i--){
        ans[i]=max(ans[i],ans[i+1]);
    }
    for(int i=1;i<=n;i++){
        cout<<ans[i]<<‘ ‘;
    }
    puts("");
}
int main(){
    scanf("%d",&n);
    for(int i=1;i<=n;i++){
        scanf("%d",&a[i]);
    }
    solve();
    return 0;
}