#include<iostream>
#include<string>
#include<vector>
#include<queue>
#include<stack>
#include<map>
#include<set>
#include<algorithm>
#include<functional>
#include<cstdio>
#include<cstdlib>
#include<cmath>
using namespace std;

#define mind(a,b) (a>b?b:a)
#define maxd(a,b) (a>b?a:b)
#define absd(x) (x<0?-(x):x)
#define pow2(x) ((x)*(x))
#define rep(i,n) for(int i=0; i<n; ++i)
#define repr(i,n) for(int i=n-1; i>=0; --i)
#define repl(i,s,n) for(int i=s; i<=n; ++i)
#define replr(i,s,n) for(int i=n; i>=s; --i)
#define repf(i,s,n,j) for(int i=s; i<=n; i+=j)
#define repe(e,obj) for(auto e : obj)

#define SP << " " <<
#define COL << " : " <<
#define COM << ", " <<
#define ARR << " -> " <<
#define PNT(STR) cout << STR << endl
#define POS(X,Y) "(" << X << ", " << Y << ")"
#define DEB(A) " (" << #A << ") " << A
#define DEBREP(i,n,val) for(int i=0; i<n; ++i) cout << val << " "; cout << endl
#define ALL(V) (V).begin(), (V).end()
#define INF 1000000007
#define INFLL 10000000000000000007LL
#define EPS 1e-9

typedef unsigned int uint;
typedef unsigned long ulong;
typedef unsigned long long ull;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> P;
//typedef pair<ll, ll> P;
typedef pair<P, int> PI;
typedef pair<int, P> IP;
typedef pair<P, P> PP;
typedef priority_queue<P, vector<P>, greater<P> > pvqueue;

#define N 400003

class StarrySkyTree {
  int n;
  int data[N];
public:
  StarrySkyTree(int n_) {
    n = 1;
    while(n < n_) n *= 2;
    rep(i, 2*n) data[i] = 0;
  }

  void update(int k, int a) {
    k += n-1;
    data[k] = a;
    while(k > 0) {
      k = (k - 1) / 2;
      data[k] = maxd(data[2*k+1], data[2*k+2]);
    }
  }

  int query(int a, int b, int k, int l, int r) {
    if(b<=l || r<=a) return 0;
    if(l<=a && b<=r) return data[k];

    int vl = query(a, b, 2*k+1, l, (l + r) / 2);
    int vr = query(a, b, 2*k+2, (l + r) / 2, r);

    return maxd(vl, vr);
  }

  int get_max(int a, int b) {
    return query(a, b, 0, 0, n);
  }
};

int n;
int a[N], b[N];
int le[N], ri[N];

int main() {
  map<int, int> m;
  cin >> n;
  int idx = 0;
  rep(i, n) {
    cin >> a[i];
    if(!m.count(a[i])) {
      m[a[i]] = idx++;
    }
  }
  rep(i, n) le[i] = ri[i] = -1;
  rep(i, n) {
    b[i] = m[a[i]];
  }

  rep(i, n) {
    if(le[b[i]]==-1) {
      le[b[i]] = i;
    }
  }
  repr(i, n) {
    if(ri[b[i]]==-1) {
      ri[b[i]] = i;
    }
  }

  StarrySkyTree sst(n);
  rep(i, n) {
    if(le[b[i]] == i) {
      sst.update(b[i], a[i]);
    }
    cout << (i ? " " : "") << sst.get_max(0, n);
    if(ri[b[i]] == i) {
      sst.update(b[i], 0);
    }
  }
  cout << endl;

  return 0;
}