#include<bits/stdc++.h>
#pragma GCC optimize(2)
using namespace std;
int n,fa[200001],pos,k=0;
struct node
{
	int h,idx;
}tree[200001];
bool cmp(node a,node b)
{
	return a.h>b.h;
}
int FastReadInt()
{
	int x=0,f=1;
	char c=getchar();
	while(c<'0'||c>'9')
	{
		if(c=='-')
		{
			f=-1;
		}
		c=getchar();
	}
	while(c>='0'&&c<='9')
	{
		x=(x<<1)+(x<<3)+(c^48),c=getchar();
	}
	return x*f;
}
int main(){
	n=FastReadInt();
	for(int i=1;i<=n;i++)
	{
		tree[i].h=FastReadInt();
		tree[i].idx=i;
	}
	sort(tree+1,tree+n+1,cmp);
	queue<int>q;
	for(int i=1;i<=n;i++)
	{
		pos=i;
		while(pos<n&&tree[pos+1].h==tree[pos].h)
		{
			pos++;
		}
		for(int j=i;j<=pos;j++)
		{
			if(q.size())
			{
				k=q.front();
				fa[tree[j].idx]=k;
				q.pop();
			}
			else
			{
				fa[tree[j].idx]=k;
			}
		}
		for(int j=i;j<=pos;j++)
		{
			q.push(tree[j].idx);
		}
		i=pos;
	}
	for(int i=1;i<=n;i++)
	{
		printf("%d ",fa[i]);
	}
	return 0;
}