#include <bits/stdc++.h>
 
using namespace std;
 
//typedef
//------------------------------------------
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef long long LL;
 
//container util
//------------------------------------------
#define ALL(a)  (a).begin(),(a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define PB push_back
#define MP make_pair
#define SZ(a) int((a).size())
#define EACH(i,c) for(typeof((c).begin()) i=(c).begin(); i!=(c).end(); ++i)
#define EXIST(s,e) ((s).find(e)!=(s).end())
#define SORT(c) sort((c).begin(),(c).end())
 
//repetition
//------------------------------------------
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n)  FOR(i,0,n)
 
//constant
//--------------------------------------------
const double EPS = 1e-10;
const double PI  = acos(-1.0);

int main(){
  cin.tie(0);
  ios_base::sync_with_stdio(false);

  int N; cin >> N;
  vector<int> xs(N);
  REP(i,N) cin >> xs[i];
  map<int,PII> mp;
  REP(i,N)
	if(!mp.count(xs[i]))
	  mp[xs[i]] = MP(i,i);
	else
	  mp[xs[i]].second = i;

  VI ans(N);
  set<int> s;
  REP(i,N){
	auto& pii = mp[xs[i]];
	if(pii.first == i)
	  s.insert(xs[i]);
	ans[i] = *s.rbegin();
	if(pii.second == i)
	  s.erase(xs[i]);
  }

  REP(i,N) cout << (i==0?"":" ") << ans[i];
  cout << endl;
  
  return 0;
}