#include<bits/stdc++.h>
using namespace std;
#define foru(i,a,b) for(int i=(a); i<=(b); ++i)
#define ford(i,a,b) for(int i=(a); i>=(b); --i)
#define rep(i,a) for(int i=0; i<(a); ++i)
#define sz(a) (int)(a).size()
#define all(a) (a).begin(),(a).end()
#define bit(s,i) (((s)>>(i))&1)
#define ii pair<int,int>
#define vi vector<int>
#define vii vector<ii>
#define fi first
#define se second
#define ll long long
#define eb emplace_back
#define pb push_back
#define __builtin_popcount __builtin_popcountll
#define _ << " " <<
template <class X, class Y> bool maxi(X &x, Y y){return x<y?x=y,true:false;}
template <class X, class Y> bool mini(X &x, Y y){return x>y?x=y,true:false;}
const int N=2e5+5;
int n,a[N];
vector<int> rar;
set<int> st[N];
void solve(){
cin>>n;
foru(i,1,n){
cin>>a[i];
rar.eb(a[i]);
}
sort(all(rar));
rar.erase(unique(all(rar)),rar.end());
foru(i,1,n){
a[i]=lower_bound(all(rar),a[i])-rar.begin();
}
vii seg;
foru(i,1,n){
if(st[a[i]].empty()){
st[a[i]].insert(i);
seg.eb(i,a[i]);
} else{
int tmp=*prev(st[a[i]].end());
while(!seg.empty() && seg.back().fi>=tmp){
st[seg.back().se].erase(seg.back().fi); seg.pop_back();
}
st[a[i]].insert(i);
seg.eb(i,a[i]);
}
}
foru(i,0,sz(seg)-1){
foru(j, i==0?1:seg[i-1].fi+1, seg[i].fi){
cout<<rar[seg[i].se]<<'\n';
}
}
}
int32_t main(){
#define task "test"
if(fopen(task".inp", "r")){
freopen(task".inp", "r", stdin);
freopen(task".out", "w", stdout);
}
cin.tie(0)->sync_with_stdio(0);
int tc=1; //cin>>tc;
foru(i,1,tc){
solve();
}
}
