#include <fstream>
#include <algorithm>
#define DM 1000003
using namespace std;

ifstream fi ("findmin.in");
ofstream fo ("findmin.out");
int n, a, pos, sol[DM], indmin, rasp[DM], v[DM];

int main()
{
	fi >> n;
	for (int i = 1; i <= n; ++i)
	{
		fi >> a;
		v[i] = a;
		sol[a] = i;
	}
	for (int i = 1; i <= n; ++i)
	{
		if (i == 1 || sol[i] < indmin)
			rasp[i] = -1, indmin = sol[i];
		else
			rasp[i] = indmin;
	}
	for (int i = 1; i <= n; ++i)
		fo << rasp[v[i]] << ' ';
	return 0;
}