//```// YF YUSUF
// #include <bits/stdc++.h>
#include <iostream>
#include <vector>
#include <set>
#include <map>
#include <algorithm>
#include <cmath>
#include <numeric>
#include <queue>
#include <stack>
#include <cassert>
#include <climits>
#include <string>
#include <cstdlib>
#include <random>
#include <iomanip>
#include <ctime>
using namespace std;
#ifdef YF_CHECK
bool LOCAL = 1;
#else
#pragma GCC optimize ("unroll-loops")
#pragma GCC optimize ("inline")
#pragma GCC optimize ("Ofast")
#pragma GCC optimize ("O3")
bool LOCAL = 0;
#endif
using i128 = __int128;
using ll = long long;
using ld = long double;
using vll = vector <ll>;
using mll = map <ll,ll>;
using pll = pair <ll,ll>;
using vvl = vector <vll>;
using vpll = vector <pll>;
template<class T>T MIN(T&a,T b){a=min(a,b);return a;}
template<class T>T MAX(T&a,T b){a=max(a,b);return a;}
#define all(a) a.begin(),a.end()
#define rall(a) a.rbegin(),a.rend()
#define sgr v+v+1,(tl+tr)/2+1,tr
#define sgl v+v,tl,(tl+tr)/2
#define pb push_back
#define ins insert
#define S second
#define F first
mt19937_64 MT(time(0));
ll BP(ll a,ll b,ll mod=1e9+7){
if(b==0)return 1;
ll q=BP(a,b/2,mod);
return ((q*q)%mod*(b%2?a:1ll))%mod;
}
ll f(ll x){return x*(x+1)/2;}
ll dup(ll a,ll b){return (a+b-1)/b;}
ll lcm(ll a,ll b){return a/__gcd(a,b)*b;}
ll invf(ll x){return (-1+sqrt(1+8*x))/2;}
ll lg(ll x){return (x ? 63 - __builtin_clzll(x) : -1);}
const ll mod=998244353;
const ll INF=1e18;
const ll inf=1e9+7;
const ll N =1e6+7;
ll n, a[N], b[N];
vpll r[N];
ll t[4*N];
ll merge(ll a,ll b){
return a+b;
}
ll worst = 0;
void push(ll v,ll tl,ll tr){
if(t[v] && tl != tr){
t[v+v] = t[v];
t[v+v+1] = t[v];
t[v] = 0;
}
}
void build(ll v=1,ll tl=1,ll tr=n){
if(tl==tr){
t[v] = a[tl];
}
else{
ll tm=(tl+tr)/2;
build(sgl);
build(sgr);
}
}
void up(ll l,ll r,ll x,ll v=1,ll tl=1,ll tr=n){
push(v, tl, tr);
if(l > tr || tl > r)return;
if(l <= tl && tr <= r){
t[v] = x;
push(v, tl, tr);
return;
}
ll tm = (tl+tr)/2;
up(l,r,x,sgl);
up(l,r,x,sgr);
}
ll get(ll pos,ll v=1,ll tl=1,ll tr=n){
push(v, tl, tr);
if(tl == tr)return t[v];
ll tm = (tl+tr)/2;
if(pos <= tm){
return get(pos, sgl);
}
else return get(pos, sgr);
}
void YF_MAIN(ll TEST){
cin>>n;
for(int i=1;i<=n;i++){
cin>>a[i];
}
{
set<ll>st;
mll mp;
for(int i=1;i<=n;i++){
st.ins(a[i]);
}
ll cnt = 0 ;
for(auto i : st){
mp[i] = ++cnt;
}
for(int i=1;i<=n;i++){
ll x = a[i];
a[i] = mp[a[i]];
b[a[i]] = x;
}
}
// cout<<"\n";
build();
for(int i=1;i<=n;i++){
if(r[a[i]].empty()){
r[a[i]].pb({i, i});
}
else{
while(r[a[i]].size()){
auto [L, R] = r[a[i]].back();
ll x = get(R);
// cout<<L<<" "<<R<<" "<<x<<"\n";
if(x != a[i]){
r[a[i]].pop_back();
}
else{
r[a[i]].back().S = i;
// cout<<R<<" "<<i<<" "<<a[i]<<" up\n";
up(R, i, a[i]);
break;
}
}
if(r[a[i]].empty()){
r[a[i]].pb({i, i});
}
if(r[a[i]].back().S != i){
r[a[i]].back().S = i;
}
}
// for(int i=1;i<=n;i++){
// cout<<get(i)<<" ";
// }
// cout<<"\n";
}
for(int i=1;i<=n;i++){
cout<<b[get(i)]<<"\n";
}
}
const bool TECT=0;
const bool FLSH=1;
const ll SN=1e0 + 7; ll SM[SN];
const ll FN=1e0 + 7; ll FACT[FN], inv[FN], FMOD=inf;
ll PER(ll n,ll k){return FACT[n] *inv[n-k]%FMOD;}
ll CNK(ll n,ll k){return PER(n,k)*inv[k ]%FMOD;}
void BEFORE(){
for(ll i=2;i<SN;i++){
if(SM[i])continue;
for(ll j=i;j<SN;j+=i)
MAX(SM[j],i);
}
FACT[0]=inv[0]=1;
for(int i=1;i<FN;i++){
FACT[i]=FACT[i-1]*i%FMOD;
inv[i]=BP(FACT[i],FMOD-2,FMOD);
}
}
signed main(){
// freopen(("input.txt"),"r",stdin);freopen(("output.txt"),"w",stdout);
if(FLSH){
ios_base::sync_with_stdio(0);
cout.setf(ios::fixed);
cout.precision(0);
cout.tie(0);
cin.tie(0);
}
cout<<(0 && LOCAL ? "\nYF_OUTPUT:\n\n" : "");
int TEST=1;
if(TECT)
cin>>TEST;
BEFORE();
for(int T=1;T<=TEST;T++){
// cout<<"Case "<<T<<": ";
YF_MAIN(T);
cout<<(T==TEST ? "" : "\n");
}
return 0;
}
// YF YUSUF ```
