#include<bits/stdc++.h>
#define int long long
using namespace std;
#define rep(i,n) for(int i=0;i<(n);++i)
#define INF (1ll<<60)
typedef pair<int, int> pii;
#define FI first
#define SE second
#define all(s) s.begin(),s.end()
#define RREP(i,n) for(int i=(n)-1;i>=0;--i)

int N;
int A[100100];
int B[100100];
map<int, int> last;

signed main() {
	cin >> N;
	rep(i,N)
	{
		cin >> A[i];
		last[A[i]] = i;
	}
	set<int> S;
	rep(i,N)
	{
		S.insert(A[i]);
		B[i] = *S.rbegin();
		if (last[A[i]] == i)
			S.erase(A[i]);
	}
	rep(i,N)
	{
		cout << (i ? " " : "") << B[i];
	}
	cout << endl;
}