#include<bits/stdc++.h>
#define REP(x,y,z) for(int x=y;x<=z;x++)
#define FORD(x,y,z) for(int x=y;x>=z;x--)
#define MSET(x,y) memset(x,y,sizeof(x))
#define FOR(x,y) for(__typeof(y.begin()) x=y.begin();x!=y.end();x++)
#define F first
#define S second
#define MP make_pair
#define PB push_back
#define SZ size()
#define M 100005
#define L (cur*2)
#define R (L+1)
void RI(){}
template<typename... T>
void RI( int& head, T&... tail ) {
    scanf("%d",&head);
    RI(tail...);
}
using namespace std;
typedef long long LL;
typedef pair<int,int> P;
int n,ans[M
];
int tree[M*4];
vector<P> in;

void upd(int cur,int ll,int rr,int l,int r,int val)
{
	if(ll==l && rr==r)
	{
		tree[cur] = max(tree[cur], val);
		return;
	}

	int mid=(ll+rr)/2;
	if(r<=mid) upd(L,ll,mid,l,r,val);
	else if(l>mid) upd(R,mid+1,rr,l,r,val);
	else
	{
		upd(L,ll,mid,l,mid,val);
		upd(R,mid+1,rr,mid+1,r,val);
	}
}
void calc(int cur,int ll,int rr,int mxv)
{
	mxv = max(mxv, tree[cur]);
	if(ll==rr)
	{
		ans[ll] = mxv;
		return;
	}
	int mid=(ll+rr)/2;
	calc(L,ll,mid,mxv);
	calc(R,mid+1,rr,mxv);
}
int main()
{
	int x;
	while(~scanf("%d",&n))
	{
		MSET(tree,0);
		in.clear();
		REP(i,1,n)
		{
			RI(x);
			in.PB( MP(x,i) );
		}
		sort(in.begin(), in.end());

		int l=0;
		while(l<n)
		{
			int r=l;
			while(r+1<n && in[r+1].F==in[r].F) r++;
			upd(1,1,n,in[l].S,in[r].S,in[l].F);
			l=r+1;
		}

		calc(1,1,n,-1);
		REP(i,1,n)
		{
			if(i!=1)putchar(' ');
			printf("%d",ans[i]);
		}
		puts("");
	}
	return 0;
}