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

#define MAX_N 100010

typedef long long LL;
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 = (m + 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){
			int t = x >> 6;
			ULL &v = val[i][t];
			cont = !v;
			v |= 1ull << (x & 63);
			x = t;
		}
		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){
			int t = x >> 6;
			ULL &v = val[i][t];
			v &= ~(1ull << (x & 63));
			cont = !v;
			x = t;
		}
		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;
			}
			x = t;
		}
		if(i == h){ return INT_MIN; }
		while(i > 0){
			--i;
			x = (x << 6) + 63 - __builtin_clzll(val[i][x]);
		}
		return x;
	}
	void swap(intset &other){
		std::swap(n, other.n);
		val.swap(other.val);
	}
};

struct hoge{
	int fst, snd;
};

int main(){
	const int INF = 1010101010;

	char buf[1500000];
	int readsize = fread(buf, 1, sizeof buf, stdin);
	buf[readsize] = 0;
	
	char *p = buf, *endp = 0;

	hoge a[MAX_N], tmp[MAX_N];
	int b[MAX_N];
	int cnt[32780] = {};

	int n = strtol(p, &endp, 10);
	p = endp;

	for(int i = 0; i < n; ++i){
		a[i].fst = strtol(p, &endp, 10);
		p = endp;
		a[i].snd = i;
	}

	for(int i = 0; i < n; ++i){
		b[i] = 32767 - (a[i].fst & 32767);
		++cnt[b[i] + 1];
	}
	for(int i = 1; i < 32768; ++i){
		cnt[i] += cnt[i - 1];
	}
	for(int i = 0; i < n; ++i){
		tmp[cnt[b[i]]++] = a[i];
	}

	memset(cnt, 0, sizeof cnt);
	for(int i = 0; i < n; ++i){
		b[i] = 32767 - (tmp[i].fst >> 15);
		++cnt[b[i] + 1];
	}
	for(int i = 1; i < 32768; ++i){
		cnt[i] += cnt[i - 1];
	}
	for(int i = 0; i < n; ++i){
		a[cnt[b[i]]++] = tmp[i];
	}
	a[n].fst = INF;

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

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

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