#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define ll long long
#define pb push_back
#define F first
#define S second

using namespace std;
//using namespace __gnu_pbds;

//typedef tree<ll, null_type, less_equal<ll>,
   // rb_tree_tag, tree_order_statistics_node_update>
    //TREE;

int main() {

	ios_base::sync_with_stdio(0); cin.tie(0);

	ll n; cin >> n;
	vector <ll> v (n);
	for (int i = 0; i < n; i++) {
        cin >> v[i];
	}
	map <ll, ll> mp;

	mp[v[0]] = 0;
    for (int i = 1; i < n; i++) {
        if (mp[v[i]] == 0 && v[i] != v[0]) {
            mp[v[i]] = i;
        }

    }

    vector <pair <ll,ll> > x;

    ll r = n-1;
    ll l = mp[v[n-1]];
    ll aux = l;
    ll help = r;
    x.pb({r-l, v[n-1]});
    map <ll,ll> Mp;
    Mp[v[n-1]]++;
    ll g = n-1;
    map <ll,ll> mapa;
    mapa[v[g]] = g;

    for (int i = n-2; i >= 0; i--) {
        r = i;
        l = mp[v[i]];
        if (l < aux && Mp[v[i]] == 0) {
            x.pop_back();

            x.pb({help - mapa[v[g]]+1, v[g]});
            x.pb({r-l+1, v[i]});

            aux = l;
            help = r;
            Mp[v[i]]++;
            g =i;
        }
        mapa[v[i]] = i;
    }
    reverse (x.begin(), x.end());
    for (auto c : x) {
        ll to = c.F;
        while (to--) {
            cout << c.S << "\n";
        }
    }
	return 0;
}
/**
1 2 !


1
1
2
2
1
2
2
1
1
2


6
1
2
1
2
3
2



**/