#include "bits/stdc++.h"
using namespace std;
#define FOR(i,j,k) for(int (i)=(j);(i)<(int)(k);++(i))
#define rep(i,j) FOR(i,0,j)
#define each(x,y) for(auto &(x):(y))
#define mp make_pair
#define all(x) (x).begin(),(x).end()
#define debug(x) cout<<#x<<": "<<(x)<<endl
#define smax(x,y) (x)=max((x),(y))
#define smin(x,y) (x)=min((x),(y))
#define MEM(x,y) memset((x),(y),sizeof (x))
#define sz(x) (int)(x).size()
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<ll> vll;

template<class Val>
vector<Val> compress(vector<Val> &v){
    vector<Val> a = v;
    sort(all(a));
    a.erase(unique(all(a)), a.end());
    each(b, v)b = (int)(lower_bound(all(a), b) - a.begin());
    return a;
}

int main(){
    int N;
    while(cin >> N){
        vi a(N), b(N);
        rep(i, N)scanf("%d", &a[i]);
        auto vals = compress(a);
        vi l(sz(vals), INT_MAX), r(sz(vals), -1);
        rep(i, N){
            smin(l[a[i]], i);
            smax(r[a[i]], i);
        }
        set<int> pos;
        rep(i, N)pos.insert(i);
        for(int i = sz(vals) - 1; i >= 0; --i){
            int val = vals[i];
            while(1){
                auto it = pos.lower_bound(l[i]);
                if(it == pos.end() || *it > r[i])break;
                b[*it] = val;
                pos.erase(it);
            }
        }
        rep(i, N)printf("%d%c", b[i], i == N - 1 ? '\n' : ' ');
    }

}