#include "bits/stdc++.h"
using namespace std;

#define DEBUG(x) cout<<#x<<": "<<x<<endl;
#define DEBUG_VEC(v) cout<<#v<<":";for(int i=0;i<v.size();i++) cout<<" "<<v[i]; cout<<endl

typedef long long ll;
#define vi vector<int>
#define vl vector<ll>
#define vii vector< vector<int> >
#define vll vector< vector<ll> >
#define vs vector<string>
#define pii pair<int,int>
#define pis pair<int,string>
#define psi pair<string,int>
#define pll pair<ll,ll>
const int inf = 1000000001;
const ll INF = 1e18 * 2;
#define MOD 1000000007
#define mod 1000000009
#define pi 3.14159265358979323846
#define Sp(p) cout<<setprecision(15)<< fixed<<p<<endl;
int dx[4] = { 1,0,-1,0 }, dy[4] = { 0,1,0,-1 };
int dx2[8] = { 1,1,0,-1,-1,-1,0,1 }, dy2[8] = { 0,1,1,1,0,-1,-1,-1 };


int main() {
	int n;
	cin >> n;
	int i, j;
	vi a(n);
	map<int, int> left, right;
	set<int> st;
	for (i = 0; i < n; i++) {
		cin >> a[i];
		st.insert(a[i]);
		if (left[a[i]] == 0) {
			left[a[i]] = i + 1;
		}
		else {
			right[a[i]] = i + 1;
		}
	}
	vi b(n);
	for (auto itr = st.begin(); itr != st.end(); itr++) {
		int x = *itr;
		if (right[x]) {
			int l = left[x] - 1, r = right[x] - 1;
			b[l] = b[r] = x;
		}
		else {
			int l = left[x] - 1;
			b[l] = -x;
		}
	}
	//DEBUG_VEC(b);
	map<int, int> state;
	priority_queue<int> pq;
	vi ans(n);
	int now = -1;
	for (i = 0; i < n; i++) {
		if (b[i]) {
			int x = b[i];
			if (x < 0) {
				if (now < abs(x)) {
					ans[i] = abs(x);
				}
				else {
					ans[i] = now;
				}
				continue;
			}
			if (state[x] == 0) {
				state[x]++;
				if (now < x) {
					pq.push(now);
					now = x;
				}
				else {
					pq.push(x);
				}
				ans[i] = now;
			}
			else if (state[x] == 1) {
				state[x]++;
				ans[i] = now;
				if (now == x) {
					now = pq.top();
					pq.pop();
					while (state[now] == 2) {
						now = pq.top();
						pq.pop();
					}
				}
			}
		}
		else {
			ans[i] = now;
		}
	}
	for (i = 0; i < n; i++) {
		cout << ans[i] << " ";
	}
	cout << endl;
}