//#define __USE_MINGW_ANSI_STDIO 0
#include <bits/stdc++.h>

using namespace std;
typedef long long ll;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<ll> VL;
typedef vector<VL> VVL;
typedef pair<int, int> PII;

#define FOR(i, a, n) for (ll i = (ll)a; i < (ll)n; ++i)
#define REP(i, n) FOR(i, 0, n)
#define ALL(x) x.begin(), x.end()
#define IN(a, b, x) (a<=x&&x<b)
#define MP make_pair
#define PB push_back
#define INF (1LL<<30)
#define LLINF (1LL<<60)
#define PI 3.14159265359
#define EPS 1e-12
//#define int ll

template <typename T> T &chmin(T &a, const T &b) { return a = min(a, b); }
template <typename T> T &chmax(T &a, const T &b) { return a = max(a, b); }

int dx[] = {0, 1, 0, -1}, dy[] = {1, 0, -1, 0};

VI aa, a, unzip(100010);
unordered_map<int, int> zip;
int n;
VI compress() {
  a = aa;
  sort(ALL(aa));
  aa.erase(unique(ALL(aa)), aa.end());
  REP(i, aa.size()) {
    zip[aa[i]] = i;
    unzip[i] = aa[i];
  }
  REP(i, a.size()) {
    a[i] = zip[a[i]];
  }
  return a;
}

const int MAX_N = 1<<17;

int dat[MAX_N*2-1], lazy[MAX_N*2-1];
bool flag[MAX_N*2-1];

void init(int n_) {
  n = 1;
  while(n < n_) n *= 2;
  REP(i, n*2-1) {
    dat[i] = INT_MAX;
    lazy[i] = 0;
    flag[i] = false;
  }
}

void eval(int k, int l, int r) {
  if(flag[k]) {
    dat[k] = lazy[k];
    if(r-l>1) {
      lazy[2*k+1] = lazy[k]; flag[2*k+1] = true;
      lazy[2*k+2] = lazy[k]; flag[2*k+2] = true;
    }
    flag[k] = false;
  }
}

void update(int a, int b, ll x, int k=0, int l=0, int r=-1) {
  if(r < 0) r = n;
  // cout << a << " " << b << " " << x << " " << k << " " << l << " " << r << endl;

  eval(k, l, r);

  if(b <= l || r <= a) {
    // cout << "a" << endl;
    return;
  }

  if(a <= l && r <= b) {
    // cout << "b" << endl;
    lazy[k] = x;
    flag[k] = true;
    eval(k, l, r);
  } else {
    // cout << "c" << endl;
    update(a, b, x, 2*k+1, l, (l+r)/2);
    update(a, b, x, 2*k+2, (l+r)/2, r);
    // dat[k] = min(dat[2*k+1], dat[2*k+2]);
  }
}

ll getMin(int a, int b, int k=0, int l=0, int r=-1) {
  if(r < 0) r = n;
  // cout << a << " " << b << " " << k << " " << l << " " << r << endl;

  eval(k, l, r);

  if(b <= l || r <= a) {
    // cout << "a" << endl;
    return INT_MAX;
  }
  if(a <= l && r <= b) {
    // cout << "b" << endl;
    return dat[k];
  }
  // cout << "c" << endl;
  ll vl = getMin(a, b, 2*k+1, l, (l+r)/2);
  ll vr = getMin(a, b, 2*k+2, (l+r)/2, r);
  return min(vl, vr);
}

void f(int k=0, int l=0, int r=n) {
  eval(k, l, r);
  if(r-l == 1) return;
  f(2*k+1, l, (l+r)/2);
  f(2*k+2, (l+r)/2, r);
}

int lr[100010][2];
signed main(void)
{
  int nn;
  cin >> nn;
  REP(i, nn) {
    int x;
    cin >> x;
    aa.PB(x);
    lr[i][0] = -1;
  }
  compress();
  // REP(i, nn) cout << a[i] << " "; cout << endl;
  REP(i, nn) {
    if(lr[a[i]][0] == -1) lr[a[i]][0] = i;
    lr[a[i]][1] = i;
  }

  init(nn);
  REP(i, nn) {
    if(lr[i][0] == -1) continue;
    // cout << lr[i][0] << " " << lr[i][1] << endl;
    // [lr[i][0], lr[i][1]+1) を unzip[i] に変更する
    update(lr[i][0], lr[i][1]+1, unzip[i]);
  }
  f();
  REP(i, nn) {
    cout << dat[i+n-1];
    if(i == nn-1) cout << "\n";
    else cout << " ";
  }

  return 0;
}