// Hallelujah, praise the one who set me free
// Hallelujah, death has lost its grip on me
// You have broken every chain, There's salvation in your name
// Jesus Christ, my living hope
#include <bits/stdc++.h>
using namespace std;
#define REP(i, s, e) for (int i = (s); i < (e); i++)
#define RREP(i, s, e) for (int i = (s); i >= (e); i--)
template <class T>
inline bool mnto(T& a, T b) {return a > b ? a = b, 1 : 0;}
template <class T>
inline bool mxto(T& a, T b) {return a < b ? a = b, 1: 0;}
typedef long long ll;
typedef long double ld;
#define FI first
#define SE second
typedef pair<int, int> ii;
typedef pair<ll, ll> pll;
typedef tuple<int, int, int> iii;
#define ALL(_a) _a.begin(), _a.end()
#define SZ(_a) (int) _a.size()
#define pb push_back
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<ii> vii;
typedef vector<iii> viii;
#ifndef DEBUG
#define cerr if (0) cerr
#endif
const int INF = 1000000005;
const ll LINF = 1000000000000000005ll;
const int MAXN = 200005;
int n;
int a[MAXN];
int occ[MAXN];
vii dis;
int inv[MAXN];
int p[MAXN], rnk[MAXN], rt[MAXN], col[MAXN];
void init() {
REP (i, 1, n + 1) {
p[i] = i;
rnk[i] = 1;
rt[i] = i;
}
}
int findp(int i) {
if (p[i] == i) {
return i;
}
return p[i] = findp(p[i]);
}
bool join(int a, int b) {
int pa = findp(a), pb = findp(b);
int nc = col[pa];
if (pa == pb) {
return 0;
}
if (rnk[pa] < rnk[pb]) {
swap(pa, pb);
}
if (rnk[pa] == rnk[pb]) {
rnk[pa]++;
}
p[pb] = pa;
col[pa] = nc;
mnto(rt[pa], rt[pb]);
return 1;
}
int main() {
#ifndef DEBUG
ios::sync_with_stdio(0), cin.tie(0);
#endif
cin >> n;
REP (i, 1, n + 1) {
cin >> a[i];
dis.pb({a[i], i});
}
sort(ALL(dis));
int ptr = 0, prv = -1;
for (auto [x, i] : dis) {
if (x != prv) {
prv = x;
ptr++;
}
a[i] = ptr;
inv[ptr] = x;
}
init();
REP (i, 1, n + 1) {
col[findp(i)] = a[i];
if (!occ[a[i]]++) {
continue;
}
cerr << i << '\n';
while (col[findp(rt[findp(i)] - 1)] != a[i]) {
cerr << ' ' << rt[findp(i)] << '\n';
occ[col[findp(rt[findp(i)] - 1)]]--;
join(i, rt[findp(i)] - 1);
}
}
REP (i, 1, n + 1) {
cout << inv[col[findp(i)]] << '\n';
}
return 0;
}
