#include <iostream>
#include <queue>
#include <vector>
#include <algorithm>
#include <map>
using namespace std;
struct d{
  int i;
  int l,r;
  bool operator<(d &a){
    return i < a.i;
  }
};
int main(){
  int n;cin>>n;
  map<int,pair<int,int>> A;
  vector<int> Z(n);
  for(int i = 0; n > i; i++){
    int t;cin>>t;
    if(!A[t].first){
      A[t].first = i+1;
    }
    A[t].second = i+1;
    Z[i] = t;
  }
  vector<int> ret[n+1],ans(n);
  for(auto x: A){
    ret[x.second.first-1].push_back(x.first);
    ret[x.second.second].push_back(-x.first);
  }
  priority_queue<int> C;
  priority_queue<int> eraser;
  
  for(int i = 0; n > i; i++){
    for(int j = 0; ret[i].size() > j; j++){
      if(ret[i][j]>0){
        C.push(ret[i][j]);
      }else if(ret[i][j] < 0){
        eraser.push(-1*ret[i][j]);
      }
    }
    //cout << C.size() << endl;
    while(C.size() && eraser.size() && C.top() == eraser.top()){
      C.pop();
      eraser.pop();
    }
    // cout << i << " " << C.size() << " " << eraser.size();
    // if(C.size())cout << " C:" << C.top();
    // if(eraser.size())cout << " e:" << eraser.top();
    // cout << endl;
    ans[i] = C.top();
  }
  for(int i = 0; n > i; i++){
    cout << max(Z[i],ans[i]);
    if(i+1 != n)cout << " ";
  }
  cout << endl;
  

}