#include <iostream>
#include <algorithm>
#include <cmath>
#include <vector>
#include <complex>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <iomanip>
#include <assert.h>
#include <array>
#include <cstdio>
#include <cstring>
#include <random>
#include <functional>
#include <numeric>
#include <bitset>

using namespace std;

#define REP(i,a,b) for(int i=a;i<(int)b;i++)
#define rep(i,n) REP(i,0,n)
#define all(c) (c).begin(), (c).end()
#define zero(a) memset(a, 0, sizeof a)
#define minus(a) memset(a, -1, sizeof a)
#define minimize(a, x) a = std::min(a, x)
#define maximize(a, x) a = std::max(a, x)

typedef long long ll;
int const inf = 1<<29;

int main() {

  int N; cin >> N;
  int A[N]; rep(i, N) cin >> A[i];
  int B[N]; minus(B);

  map<int, int> last;
  rep(i, N) {
    if(last.find(A[N-1-i]) == last.end()) {
      last[A[N-1-i]] = N-1-i;
    }
  }

  set<int, greater<int>> st;

  rep(i, N) {
    st.insert(A[i]);
    B[i] = *(st.begin());
    if(last[A[i]] == i) {
      st.erase(A[i]);
    }
  }

  rep(i, N) {
    cout << B[i] << (i == N - 1 ? '\n' : ' ');
  }

  return 0;
}