#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef complex<double> P;
typedef pair<int,int> pii;
#define REP(i,n) for(ll i=0;i<n;++i)
#define REPR(i,n) for(ll i=1;i<n;++i)
#define FOR(i,a,b) for(ll i=a;i<b;++i)

#define DEBUG(x) cout<<#x<<": "<<x<<endl
#define DEBUG_VEC(v) cout<<#v<<":";REP(i,v.size())cout<<" "<<v[i];cout<<endl
#define ALL(a) (a).begin(),(a).end()

#define MOD (ll)(1e9+7)
#define ADD(a,b) a=((a)+(b))%MOD
#define FIX(a) ((a)%MOD+MOD)%MOD

int main(){
  ll n;
  cin>>n;
  vl a(n),b(n,-1);
  REP(i,n)cin>>a[i];
  map<ll,ll> left,right;
  REP(i,n){
    if(left.count(a[i])==0){
      left[a[i]] = i;
      right[a[i]] = i;
    }else{
      left[a[i]] = min(left[a[i]],i);
      right[a[i]] = max(right[a[i]],i);
    }
  }
  map<ll,ll>::iterator iter,iter2;
  iter = left.begin();
  iter2 = right.begin();
  vector<vl> put(n+1),out(n+1);
  while(iter != left.end()){
    ll lf = iter->second, rg = iter2->second;
    put[lf].push_back(iter->first);
    out[rg+1].push_back(iter->first);
    ++iter;
    ++iter2;
  }
  set<ll> q;
  REP(i,n){
    REP(j,out[i].size())q.erase(out[i][j]);
    REP(j,put[i].size())q.insert(put[i][j]);
    b[i] = *q.rbegin();
  }
  cout << b[0];
  REPR(i,n)cout << " " << b[i];
  cout << endl;
  return 0;
}