#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;
typedef vector< pii > vp;
typedef vector< double > vd;
typedef vector< vd > vvd;
typedef vector< string > vs;

template< class T1, class T2 >
int upmin( T1 &x, T2 v ){
  if( x > v ){
    x = v;
    return 1;
  }
  return 0;
}

template< class T1, class T2 >
int upmax( T1 &x, T2 v ){
  if( x < v ){
    x = v;
    return 1;
  }
  return 0;
}

const int INF = 0x3f3f3f3f;

int N;
vi A;

void init(){
  cin >> N;
  A = vi( N );
  for( int i = 0; i < N; ++i )
    cin >> A[ i ];
}

map< int, int > last_pos;
vi B;

void preprocess(){
  for( int i = 0; i < N; ++i )
    last_pos[ A[ i ] ] = i;
  B = vi( N );
  set< int > covering_a;
  for( int i = 0; i < N; ++i ){
    if( not covering_a.count( A[ i ] ) )
      covering_a.emplace( A[ i ] );
    B[ i ] = *--covering_a.end();
    if( i == last_pos[ A[ i ] ] )
      covering_a.erase( A[ i ] );
  }
}

void solve(){
  for( int i = 0; i < N; ++i )
    cout << B[ i ] << " \n"[ i + 1 == N ];
}

signed main(){
  ios::sync_with_stdio( 0 );
  init();
  preprocess();
  solve();
  return 0;
}