#include <bits/stdc++.h>
using namespace std;
typedef signed long long ll;

#undef _P
#define _P(...) (void)printf(__VA_ARGS__)
#define FOR(x,to) for(x=0;x<to;x++)
#define FORR(x,arr) for(auto& x:arr)
#define ITR(x,c) for(__typeof(c.begin()) x=c.begin();x!=c.end();x++)
#define ALL(a) (a.begin()),(a.end())
#define ZERO(a) memset(a,0,sizeof(a))
#define MINUS(a) memset(a,0xff,sizeof(a))
//-------------------------------------------------------

int N,A[101010];
map<int,int> mi,ma;
vector<int> sev[101010],eev[101010];

void solve() {
	int i,j,k,l,r,x,y; string s;
	
	cin>>N;
	FOR(i,N) {
		cin>>A[i];
		if(mi.count(A[i])) ma[A[i]]=i;
		else mi[A[i]]=ma[A[i]]=i;
	}
	
	FORR(r,mi) {
		sev[r.second].push_back(r.first);
		eev[ma[r.first]].push_back(r.first);
	}
	
	set<int> S;
	FOR(i,N) {
		FORR(r,sev[i]) S.insert(r);
		_P("%d",*S.rbegin());
		FORR(r,eev[i]) S.erase(r);
		_P("%c",(i==N-1)?'\n':' ');
	}
	
	
}


int main(int argc,char** argv){
	string s;int i;
	if(argc==1) ios::sync_with_stdio(false);
	FOR(i,argc-1) s+=argv[i+1],s+='\n';
	FOR(i,s.size()) ungetc(s[s.size()-1-i],stdin);
	solve(); return 0;
}