#include<bits/stdc++.h>
using namespace std;

#define NAME ""
#define ll long long
#define pii pair < int , int >
#define fi first
#define se second
#define FOR(i, a, b) for (int i = (a), _b = (b); i <= _b; i ++)
#define FORD(i, a, b) for (int i = (a), _b = (b); i >= _b; i --)
#define REP(i, n) for (int i = 0, _n = (n); i < _n; i ++)
#define bit(x, i) (((x) >> (i)) & 1ll)
#define mask(x) (1ll << (x))
#define mem(f, x) memset(f, x, sizeof(f))
#define sz(x) (int32_t) (x.size())

const int nmax = 2e5;
int a[nmax + 7], f[nmax + 7];
vector < int > pos[nmax + 7];

int find_left(int i) {
  return (f[i] == i ? i : find_left(f[i]));
}

signed main() {
  for(string s: {NAME, ""}) {
    if (fopen((s + ".inp").c_str(), "r")) {
      freopen((s + ".inp").c_str(), "r", stdin);
      freopen((s + ".out").c_str(), "w", stdout);
      break;
    }
  }
  cin.tie(0)->sync_with_stdio(0);

  int n;
  cin >> n;

  vector < int > val;
  FOR(i, 1, n) {
    cin >> a[i];
    val.push_back(a[i]);
  }

  sort(val.begin(), val.end());
  val.erase(unique(val.begin(), val.end()), val.end());

  FOR(i, 1, n) {
    int x = lower_bound(val.begin(), val.end(), a[i]) - val.begin();
    f[i] = i;

    while (!pos[x].empty()) {
      int l = pos[x].back();
      pos[x].pop_back();
      if (f[l] != l) {
        continue;
      }

      int r = i - 1;
      while (r > l) {
        int tmp = find_left(r);
        f[r] = l;
        r = tmp - 1;
      }
    }
    pos[x].push_back(i);
  }

  FOR(i, 1, n) {
    cout << a[find_left(i)] << "\n";
  }

  return 0;
}