#include<bits/stdc++.h>
using namespace std;
#include<atcoder/lazysegtree>
using ll=long long;
int main(){
	ll N;cin>>N;
	vector<ll> A(N);
	for(auto&a:A)cin>>a;
	map<ll,pair<ll,ll>> mp;
	for(ll i=0;i<N;i++){
		if(!mp.contains(A[i])) mp[A[i]]={i,i};
		else{
			mp[A[i]]={min(mp[A[i]].first,i),max(i,mp[A[i]].second)};
		}
	}
	atcoder::lazy_segtree<ll,
												[](ll x,ll y){return max(x,y);},
												[]{return 0;},
												ll,
												[](ll f,ll x){return (f==-1?x:f);},
												[](ll f,ll g){return (f==-1?g:f);},
												[]{return -1;}> seg(A);
	for(auto[a,tmp]:mp){
		auto[l,r]=tmp;
		seg.apply(l,r+1,a);
	}
	for(int i=0;i<N;i++) cout<<seg.prod(i,i+1)<<' ';
}