#include <bits/stdc++.h>
#define GET_MACRO(a, b, c, NAME, ...) NAME
#define rep(...) GET_MACRO(__VA_ARGS__, rep3, rep2)(__VA_ARGS__)
#define rep2(i, a) rep3 (i, 0, a)
#define rep3(i, a, b) for (int i = (a); i < (b); i++)
#define repr(...) GET_MACRO(__VA_ARGS__, repr3, repr2)(__VA_ARGS__)
#define repr2(i, a) repr3 (i, 0, a)
#define repr3(i, a, b) for (int i = (b) - 1; i >= (a); i--)
template<class T1, class T2> inline bool chmin(T1 &a, T2 b) { return b < a && (a = b, true); }
template<class T1, class T2> inline bool chmax(T1 &a, T2 b) { return a < b && (a = b, true); }
using namespace std;
typedef long long ll;

int main() {
	int n;
	cin >> n;
	vector<int> a(n);
	rep (i, n) scanf("%d", &a[i]);
	map<int, int> first, last;
	repr (i, n) first[a[i]] = i;
	rep (i, n) last[a[i]] = i;
	vector<stack<int>> start(n), end(n);
	for (auto kv : first) if (last.count(kv.first)) {
		start[kv.second].push(kv.first);
		end[last[kv.first]].push(kv.first);
	}

	set<int> st;
	rep (i, n) {
		while (!start[i].empty()) {
			int top = start[i].top(); start[i].pop();
			st.insert(-top);
		}
		if (!st.empty()) {
			a[i] = -*st.begin();
		}
		while (!end[i].empty()) {
			int top = end[i].top(); end[i].pop();
			st.erase(-top);
		}
	}

	rep (i, n) printf("%d ", a[i]);
	cout << endl;
	return 0;
}