#include <bits/stdc++.h>
#pragma GCC optimize(2)
using namespace std;
#define int long long
//fixed << setprecision()
const int length = 2e5;
struct node
{
	int v, id;	
};
node c[length];
int n, mx = -1;
int far[length];
bool cmp(node a, node b)
{
	if(a.v != b.v)
	{
		return a.v > b.v;
	}
	return a.id < b.id;
}
vector<node> tu[length];
signed main()
{
	ios::sync_with_stdio(false);
	cin >> n;
	for(int i = 1;i <= n;i++)
	{
		cin >> c[i].v;
		c[i].id = i;
		tu[c[i].v].push_back(c[i]);
		mx = max(mx, c[i].v);
	}
	far[tu[mx][0].id] = 0;
	queue<node> q;
	q.push(tu[mx][0]);
	for(int i = mx - 1;i >= 0;i--)
	{
		
		auto ff = q.front().v;
		int ls = q.front().id;
		for(auto ss:tu[i])
		{
			q.push(ss);
			if(q.front().v == ff)
			{
				far[ss.id] = q.front().id;
				ls = q.front().id;
				q.pop();
				
			}
			else
			{
				far[ss.id] = ls;
			}
		}
	}
	for(int i = 1;i <= n;i++)
	{
		cout << far[i] << " \n"[i == n];
	}
	return 0;
}