#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define ll long long
#define ld long double
#define ull unsigned long long
#define ff first
#define ss second
#define pii pair<int,int>
#define pll pair<long long, long long>
#define vi vector<int>
#define vl vector<long long>
#define pb push_back
#define rep(i, b) for(int i = 0; i < (b); ++i)
#define rep2(i,a,b) for(int i = a; i <= (b); ++i)
#define rep3(i,a,b,c) for(int i = a; i <= (b); i+=c)
#define count_bits(x) __builtin_popcountll((x))
#define all(x) (x).begin(),(x).end()
#define siz(x) (int)(x).size()
#define forall(it,x) for(auto& it:(x))
using namespace __gnu_pbds;
using namespace std;
typedef tree<int, null_type, less<int>, rb_tree_tag,tree_order_statistics_node_update> ordered_set;
//mt19937 mt;void random_start(){mt.seed(chrono::time_point_cast<chrono::milliseconds>(chrono::high_resolution_clock::now()).time_since_epoch().count());}
//ll los(ll a, ll b) {return a + (mt() % (b-a+1));}
const int INF = 1e9+50;
const ll INF_L = 1e18+40;
const ll MOD = 1e9+7;
struct seg
{
int l,r,c;
bool operator<(const seg& other) const
{
return l < other.l;
}
};
map<int,int> prevPoz;
set<seg> segs;
int ans[200'001];
int main()
{
ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
//random_start();
int n;
cin >> n;
rep(i,n)
{
int a;
cin >> a;
if(prevPoz.find(a) == prevPoz.end()) prevPoz[a] = -1;
if(prevPoz[a] == -1)
{
prevPoz[a] = i;
segs.insert({i,i,a});
}
else
{
int prv = prevPoz[a];
while(siz(segs) != 0)
{
auto it = segs.end();
it--;
if((*it).r < prv) break;
if((*it).c != a) prevPoz[(*it).c] = -1;
segs.erase(it);
}
segs.insert({prv,i,a});
}
}
forall(it,segs)
{
rep2(i,it.l,it.r) ans[i] = it.c;
}
rep(i,n) cout << ans[i] << "\n";
}
