#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef unsigned long long ull;
#define REP(i, n) for(int i=0; i<n; i++)
#define REPi(i, a, b) for(int i=int(a); i<int(b); i++)
#define MEMS(a,b) memset(a,b,sizeof(a))
#define mp make_pair
#define MOD(a, m) ((a % m + m) % m)
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
const ll MOD = 1e9+7;


int main(){
    int N;
    cin >> N;
    vector<ll> A(N);
    for(auto& a : A) cin >> a;

    map<ll, int, greater<ll>> left, right;
    auto update_left = [&](ll key, int val){
        if(left.count(key) == 0) left[key] = val;
        else chmin(left[key], val);
    };
    REP(i,N){
        update_left(A[i], i);
        right[A[i]] = i;
    }

    vector<ll> B(N);
    set<int> se;
    REP(i,N) se.insert(i);
    for(auto& [a, L] : left){
        auto R = right[a];
        int idx = L;
        while(1){
            auto iter = se.lower_bound(idx);
            if(iter == se.end()) break;
            if(*iter > R) break;
            idx = *iter;
            B[idx] = a;
            se.erase(iter);
            idx++;
        }
    }

    for(auto& b : B) cout << b << " ";
    cout << endl;
    return 0;
}