// File stonearranging2.cpp created on 29.09.2025 at 09:00:26
#include <bits/stdc++.h>
using i64 = long long;
#ifdef DEBUG
#include "/home/ahmetalp/Desktop/Workplace/debug.h"
#else
#define debug(...) void(23)
#endif
int main() {
std::ios::sync_with_stdio(false);
std::cin.tie(nullptr);
int N;
std::cin >> N;
std::vector<int> A(N);
for (int i = 0; i < N; ++i) {
std::cin >> A[i];
}
std::map<int, int> idx;
for (int i = 0; i < N; ++i) {
idx[A[i]] = i;
}
int r = -1, val = -1;
std::vector<int> ans(N);
for (int l = 0; l < N; ++l) {
if (l <= r) {
ans[l] = val;
} else {
r = idx[A[l]];
val = A[l];
ans[l] = val;
}
}
for (int i = 0; i < N; ++i) {
std::cout << ans[i] << '\n';
}
return 0;
}
