#include <vector>
#include <map>
#include <set>
#include <cstdio>
using namespace std;
int main(){
	int N;
	scanf("%d",&N);
	map<int,pair<int,int> >m;
	vector<int>v(N);
	for(int i=0,x;i<N;i++){
		scanf("%d",&x);
		v[i]=x;
		if(m.find(x)==m.end())m[x]=make_pair(i,i);
		else m[x].second=i;
	}
	set<int>sa,sb,s;
	for(auto &e:m)sa.insert(e.second.first),sb.insert(e.second.second);
	for(int i=0;i<N;i++){
		if(sa.find(i)!=sa.end())s.insert(v[i]);
		printf(i<N-1?"%d ":"%d\n",*s.rbegin());
		if(sb.find(i)!=sb.end())s.erase(v[i]);
	}
}