#include <iostream>
#include <vector>
#include <map>
#include <algorithm>
using namespace std;

#define REP(i,s,e) for (i = s; i <= e; i++)
#define rep(i,n) REP (i,0,(int)(n)-1)
#define RREP(i,s,e) for (i = s; i >= e; i--)
#define rrep(i,n) RREP (i,(int)(n)-1,0)
#define INF (int)1e8
#define MOD (int)(1e9+7)

typedef long long ll;

int a[100100], nxt[100100];
bool used[100100];

int main(void) {
    int i, n;
    map<int,pair<int,int>> mp;
    scanf("%d",&n);
    rep (i,n) {
        scanf("%d",a+i);
        if (!mp.count(a[i]))
            mp[a[i]].first = i;
        else 
            mp[a[i]].second = i;
        nxt[i] = i+1;
    }
    for (auto p = mp.rbegin(); p != mp.rend(); p++) {
        int s, e;
        s = p->second.first; e = p->second.second;
        while ((s = nxt[s]) <= e) {
            if (!used[s])
                a[s] = p->first;
        }
        e = s; s = p->second.first;
        used[s] = true;
        while (s < e) {
            int tmp = nxt[s];
            nxt[s] = e;
            s = tmp;
        }
    }
    rep (i,n) printf("%d%c",a[i],i < n-1 ? ' ' : '\n');
    return 0;
}