#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <numeric>
#include <bitset>
#include <complex>
#define rep(x, to) for (int x = 0; x < (to); x++)
#define REP(x, a, to) for (int x = (a); x < (to); x++)
#define foreach(itr, x) for (typeof((x).begin()) itr = (x).begin(); itr != (x).end(); itr++)
#define EPS (1e-14)

using namespace std;

typedef long long ll;
typedef pair<int, int> PII;
typedef pair<ll, ll> PLL;
typedef complex<double> Complex;
typedef vector< vector<int> > Mat;

int N;
int A[100005];
int b[100005];

set<int> S;
multiset<int> mS;

void solve() {
	rep(i, N) mS.insert(A[i]);
	rep(i, N) {
		S.insert(A[i]);
		b[i] = (*--S.end());
		// cout << (*--S.end()) << " hoge" << endl;
		mS.erase(mS.find(A[i]));
		if (mS.find(A[i]) == mS.end()) {
			S.erase(A[i]);
		}
	}
	rep(i, N) {
		cout << b[i] << " ";
	}
	cout << endl;
}

int main() {
	cin >> N;
	rep(i, N) cin >> A[i];
	solve();
	return 0;
}