#include<bits/stdc++.h>
using namespace std;
using ll=long long;
using ld=long double;
using pii=pair<int,int>;
#define f first
#define s second
#define pb push_back
#define REP(i,n) for(int i=0;i<n;i++)
#define REP1(i,n) for(int i=1;i<=n;i++)
#define FILL(n,x) memset(n,x,sizeof(n))
#define ALL(_a) _a.begin(),_a.end()
#define sz(x) (int)x.size()
#define SORT_UNIQUE(c) (sort(c.begin(),c.end()),c.resize(distance(c.begin(),unique(c.begin(),c.end()))))
const ll maxn=2e5+5;
const ll maxlg=__lg(maxn)+2;
const ll INF64=4e18;
const int INF=0x3f3f3f3f;
const int MOD=1e9+7;
const ld PI=acos(-1);
const ld eps=1e-4;
#define lowb(x) x&(-x)
#define MNTO(x,y) x=min(x,(__typeof__(x))y)
#define MXTO(x,y) x=max(x,(__typeof__(x))y)
map<int,int> mp;
int main(){
int n;
cin>>n;
vector<pii> v;
REP(i,n){
int x;
cin>>x;
mp[x]++;
int len=1;
if(mp[x]>1){
while(sz(v) and v.back().f!=x){
mp[v.back().f]-=v.back().s;
len+=v.back().s;
v.pop_back();
}
}
v.pb({x,len});
}
for(auto x:v){
REP(j,x.s) cout<<x.f<<'\n';
}
}
