#include <cstdio>
#include <iostream>
#include <vector>
#include <set>
#include <algorithm>
#include <utility>
#include <climits>
#include <functional>
using namespace std;

#define MAX_N 100010


typedef long long LL;
typedef pair<int,int> pii;


int par[MAX_N];
int nxt[MAX_N];
int find(int x){
	if(par[x] < 0){ return x; }
	return par[x] = find(par[x]);
}
void unite(int x, int y){
	x = find(x);
	y = find(y);
	if(x == y){ return; }
	if(par[x] < par[y]){ swap(x, y); }
	par[y] += par[x];
	par[x] = y;
	if(nxt[y] < nxt[x]){ nxt[y] = nxt[x]; }
}

LL a[MAX_N];
int b[MAX_N];

int main(){
	const int INF = 1010101010;

	int n;
	scanf("%d", &n);
	for(int i = 0; i <= n; ++i){
		par[i] = -1;
		nxt[i] = i + 1;
	}

	for(int i = 1; i <= n; ++i){
		int x;
		scanf("%d", &x);
		a[i] = (LL)(INF - x) << 32 | i;
	}
	sort(a + 1, a + (n + 1));
	a[n + 1] = LLONG_MAX;

	for(int i = 1; i <= n; ){
		int j;
		int val = a[i] >> 32;
		for(j = i + 1; (a[j] >> 32) == val; ++j);
		val = INF - val;
		int l = a[i] & 0x7fffffff, r = a[j - 1] & 0x7fffffff;
		while(1){
			int x = nxt[find(l - 1)];
			if(x > r){ break; }
			b[x] = val;
			unite(l - 1, x);
		}
		i = j;
	}

	for(int i = 1; i <= n; ++i){
		printf("%d%c", b[i], i == n ? '\n' : ' ');
	}
}