#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <cstdio>
#include <queue>
#include "math.h"
#include <complex>
#include <iomanip>
#include <map>
#include <set>
#define ifor(i,a,b) for (int i=(a);i<(b);i++)
#define rfor(i,a,b) for (int i=(b)-1;i>=(a);i--)
#define rep(i,n) for (int i=0;i<(n);i++)
#define rrep(i,n) for (int i=(n)-1;i>=0;i--)
using namespace std;
typedef long double ld;
typedef long long int  lli;
typedef complex <double> P;
const double eps = 1e-11;
int vex[4]={1,0,-1,0};
int vey[4]={0,1,0,-1};
typedef vector<double> Vec;
typedef vector<int> vec;
typedef vector<Vec> MAT;
typedef vector<vec> mat;
lli MOD=1000000007;
int main(){
  int n;
  cin >> n;
  int a[1000004];
  map<int,int> tr;
  rep(i,n){cin>>a[i];tr[a[i]]=i;}
  set<int> d;
  rep(i,n){
    d.insert(a[i]);
    cout<<*d.rbegin();//2分探索木の一番
    if(i==tr[a[i]])d.erase(a[i]);
    printf("%c",(i==n-1)?'\n':' ');
  }
}