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

int main(){
    int n;
    cin >> n;

    vector<int> a(n);
    map<int,int> l, r;
    for(int i = 0; i < n; i++){
        cin >> a[i];
        if(l.count(a[i]) == 0)  l[a[i]] = i;
        r[a[i]] = i;
    }
    sort(a.rbegin(), a.rend());
    a.erase(unique(a.begin(), a.end()), a.end());

    vector<int> ans(n, 0);
    for(int val : a){
        int le = l[val], ri = r[val];
        
        int cur = l[val];
        while(cur <= ri && ans[cur] == 0)   ans[cur++] = val;
        cur = ri;
        while(cur >= le && ans[cur] == 0)   ans[cur--] = val;
    }

    for(int i = 0; i < n; i++)  cout << ans[i] << " \n"[i == n-1];

    return 0;
}