#include <bits/stdc++.h>

// #define int int64_t

const int kMaxN = 2e5 + 5;

int n, m, t;
int a[kMaxN], unq[kMaxN];
std::pair<int, int> b[kMaxN];
std::priority_queue<int> q[kMaxN];

void discrete() {
  for (int i = 1; i <= n; ++i) unq[i] = a[i];
  std::sort(unq + 1, unq + 1 + n);
  t = std::unique(unq + 1, unq + 1 + n) - (unq + 1);
  for (int i = 1; i <= n; ++i)
    a[i] = std::lower_bound(unq + 1, unq + 1 + t, a[i]) - unq;
}

void dickdreamer() {
  std::cin >> n;
  for (int i = 1; i <= n; ++i) std::cin >> a[i];
  discrete();
  for (int i = 1; i <= n; ++i) {
    int cnt = 1;
    if (q[a[i]].size()) {
      int t = q[a[i]].top();
      for (; m >= t; --m) {
        cnt += b[m].second;
        q[b[m].first].pop();
      }
    }
    b[++m] = {a[i], cnt};
    q[a[i]].emplace(m);
  }
  for (int i = 1; i <= m; ++i)
    for (int j = 1; j <= b[i].second; ++j)
      std::cout << unq[b[i].first] << '\n';
}

int32_t main() {
#ifdef ORZXKR
  freopen("in.txt", "r", stdin);
  freopen("out.txt", "w", stdout);
#endif
  std::ios::sync_with_stdio(0), std::cin.tie(0), std::cout.tie(0);
  int T = 1;
  // std::cin >> T;
  while (T--) dickdreamer();
  // std::cerr << 1.0 * clock() / CLOCKS_PER_SEC << "s\n";
  return 0;
}