#include<iostream>
#include<stdio.h>
#include<stdint.h>
#include<vector>
#include<algorithm>
#include<utility>
#include<set>
#include<map>
#include<queue>
#include<stack>
#include<iomanip>
#include<string>
#include<math.h>
#include<assert.h>
using namespace std;
const double PI = (double) atan(1.0) * 4;
const int64_t INF = (int64_t) 1e18 + 777;
const int64_t mINF = (int64_t) 1e6 + 777;
const int64_t offset = (int64_t) 1e6 + 777;
const int64_t MOD = 1e9 + 7;
const int nbit = 11;
const int ndig = 10;
const int nchar = 26;
const int p1 = 31;
const int p2 = 53;
const int D = 4;
int dr[D] = {0, 1, 0, -1};
int dc[D] = {1, 0, -1, 0};
// 0 right // 1 down // 2 left // 3 up
int modadd(int t1, int t2)
{
int res = t1 + t2;
if(res >= MOD) res -= MOD;
return res;
}
int modmul(int t1, int t2)
{
int64_t res = 1LL * t1 * t2;
return (res % MOD);
}
struct Range
{
int l; int r;
Range(int l_, int r_) : l(l_), r(r_) {}
bool operator < (const Range& o) const
{
return l < o.l;
}
};
struct Solution
{
int n;
Solution() {}
void solve()
{
cin >> n;
vector<int> a(n);
for(int i = 0; i < n; i++)
{
cin >> a[i];
}
vector<Range> v;
map<int, int> mp;
for(int i = n - 1; i >= 0; i--)
{
if(mp.count(a[i])) v.emplace_back(i, mp[a[i]]);
mp[a[i]] = i;
}
sort(v.begin(), v.end());
int c = -1;
int cur = -1;
int id = 0;
for(int i = 0; i < n; i++)
{
while(id < (int) v.size() && v[id].l < cur)
{
id++;
}
if(id < (int) v.size() && i == v[id].l)
{
c = a[i];
cur = v[id].r;
}
if(cur < i) cout << a[i] << "\n";
else cout << c << "\n";
}
}
int modsub(int t1, int t2)
{
int res = t1 - t2;
if(res < 0) res += MOD;
return res;
}
bool BIT(int& mask, int& j)
{
return (mask & MASK(j));
}
int64_t Abs(int64_t t1)
{
if(t1 < 0) return -t1;
return t1;
}
int MASK(int j)
{
return (1 << j);
}
};
void __startup()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL); cout.tie(NULL);
// freopen("in.txt", "r", stdin);
// freopen("out.txt", "w", stdout);
}
int main()
{
__startup();
int t = 1;
// cin >> t;
for(int i = 1; i <= t; i++)
{
Solution().solve();
}
return 0;
}
