#include <bits/stdc++.h>
using namespace std;
int main(void){
    int n;
    cin>>n;
    int a[n];
    for(int i=0;i<n;i++)cin>>a[i];
    vector<long long> xs;
    for(int i=0;i<n;i++)xs.push_back(a[i]);
    sort(xs.begin(), xs.end());
    xs.erase(unique(xs.begin(), xs.end()), xs.end());
    
    int mn[xs.size()],mx[xs.size()];
    for(int i=0;i<xs.size();i++)mn[i]=-1,mx[i]=-1;
    
    priority_queue<pair<int,int>>pq;
    priority_queue<pair<int,int>>pq2;
    
    for(int i=0;i<n;i++){
        auto iter=lower_bound(xs.begin(), xs.end(),a[i]);
        int pos = iter-xs.begin();
        if(mn[pos]==-1){
            mn[pos]=i;
            mx[pos]=i;
            pq2.push({-i,pos});
        }else{
            mx[pos]=i;
        }
    }
    
    // for(int i=0;i<xs.size();i++){
    //     cout<<xs[i]<<" "<<mn[i]<<" "<<mx[i]<<endl;
    // }
    
    for(int i=0;i<n;i++){
        while(!pq2.empty()&&-pq2.top().first==i){
            pq.push({xs[pq2.top().second],pq2.top().second});
            pq2.pop();
        }
        while(mx[pq.top().second]<i){
            pq.pop();
        }
        
        cout<<pq.top().first<<(i==n?"\n":" ");
    }
    
    return 0;
}