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

typedef pair<int,int> pii;

struct intset{
	typedef unsigned long long ULL;
	vector<vector<ULL> > val;
	int n;
	intset() : n() {}
	explicit intset(int m){
		init(m);
	}
	void init(int m){
		n = m;
		val.clear();
		do{
			int t = (n + 63) >> 6;
			val.emplace_back(t);
			m = t;
		} while(m > 1);
	}
	bool contains(int x) const{
		if(x < 0 || x >= n){ return false; }
		return val[0][x >> 6] >> (x & 63) & 1;
	}
	bool insert(int x){
		if(x < 0 || x >= n){ return false; }
		if(contains(x)){ return false; }
		int h = val.size();
		bool cont = true;
		for(int i = 0; cont && i < h; ++i){
			ULL &v = val[i][x >> 6];
			cont = !v;
			v |= 1ull << (x & 63);
			x >>= 6;
		}
		return true;
	}
	bool erase(int x){
		if(x < 0 || x >= n){ return false; }
		if(!contains(x)){ return false; }
		int h = val.size();
		bool cont = true;
		for(int i = 0; cont && i < h; ++i){
			ULL &v = val[i][x >> 6];
			v &= ~(1ull << (x & 63));
			cont = !v;
			x >>= 6;
		}
		return true;
	}
	int successor(int x) const{
		if(x >= n){ return INT_MAX; }
		if(x < 0){
			if(contains(0)){ return 0; }
			x = 0;
		}
		int h = val.size();
		int i;
		for(i = 0; i < h; ++i){
			int t = x >> 6;
			ULL v = val[i][t];
			v &= ~((2ull << (x & 63)) - 1);
			if(v){
				x = (t << 6) + __builtin_ctzll(v);
				break;
			}
			x = t;
		}
		if(i == h){ return INT_MAX; }
		while(i > 0){
			--i;
			x = (x << 6) + __builtin_ctzll(val[i][x]);
		}
		return x;
	}
	int predecessor(int x) const{
		if(x <= 0){ return INT_MIN; }
		if(x >= n){
			if(contains(n - 1)){ return n - 1; }
			x = n - 1;
		}
		int h = val.size();
		int i;
		for(i = 0; i < h; ++i){
			int t = x >> 6;
			ULL v = val[i][t];
			v &= (1ull << (x & 63)) - 1;
			if(v){
				x = (t << 6) + 63 - __builtin_clzll(v);
				break;
			}
		}
		if(i == h){ return INT_MIN; }
		while(i > 0){
			--i;
			x = (x << 6) + 63 - __builtin_clzll(val[i][x]);
		}
		return x;
	}
};

int main(){
	const int INF = 1010101010;

	int n;
	scanf("%d", &n);
	vector<pii> v(n + 1);
	for(int i = 0; i < n; ++i){
		int x;
		scanf("%d", &x);
		v[i] = pii(-x, i);
	}
	v[n] = pii(INF, INF);
	sort(v.begin(), v.end());

	intset is(n);
	for(int i = 0; i < n; ++i){
		is.insert(i);
	}
	vector<int> b(n);

	for(int i = 0; i < n; ){
		int j;
		int val = -v[i].first;
		for(j = i + 1; v[j].first == -val; ++j);
		int l = v[i].second, r = v[j - 1].second;
		int x;
		while((x = is.successor(l - 1)) <= r){
			b[x] = val;
			is.erase(x);
		}
		i = j;
	}

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