#include <bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
typedef tree<int, null_type, less_equal<int>, rb_tree_tag, tree_order_statistics_node_update> ordered_multiset;
#define ll long long
#define pb push_back
#define all(x) x.begin(), x.end()
const int mod = 1000000007;
const int N = 200005;
ll a[N+2], dp[N+2], col[N+2];
void solve(){
int n;
cin>>n;
for(int i = 0; i < n; i++){
cin>>a[i];
col[i] = a[i];
}
stack<array<ll, 2>> s;
map<ll, ll> mp;
vector<array<ll, 2>> v;
for(int i = 0; i < n; i++){
if(mp[a[i]]){
while(s.top()[1] != a[i]){
mp[s.top()[1]]--;
s.pop();
}
v.pb({i, -s.top()[0]});
}
else{
mp[a[i]]++;
s.push({i, a[i]});
}
}
sort(all(v));
const ll sz = v.size();
ll mnL = 0;
if(sz != 0)mnL = v[sz - 1][0];
for(int i = sz - 1; i >= 0; i--){
for(int j = mnL; j >= -v[i][1]; j--){
col[j] = col[v[i][0]];
}
mnL = min(mnL, -v[i][1] - 1);
}
for(int i = 0; i < n; i++){
cout<<col[i]<<' ';
}
}
int main(){
cin.tie(0)->sync_with_stdio(0);
int tt = 1;
//cin>>tt;
while(tt--){
solve();
cout<<'\n';
}
}
