#include<bits/stdc++.h>
using namespace std;
struct d{
	int x,id,f;
}a[200005];
bool cmp(d x,d y){
	return x.x>y.x;
}
bool gy(d x,d y){
	return x.id<y.id;
}
int n,h[200005],jh[200005];
int main(){
	cin>>n;
	for(int i=1;i<=n;i++){
		cin>>a[i].x;
		a[i].id=i;
	}
	sort(a+1,a+n+1,cmp);
	h[a[1].x]=a[1].id;
	jh[a[1].x]=1;
	for(int i=2;i<=n;i++){
		a[i].f=h[a[i].x+1];
		if(!jh[a[i].x]){
			h[a[i].x]=a[i].id; 
			jh[a[i].x]=i;
		}
		if(a[jh[a[i].x+1]].x==a[jh[a[i].x+1]+1].x){
			h[a[i].x+1]=a[++jh[a[i].x+1]].id;
			//偏移
		}
	}
	sort(a+1,a+n+1,gy);
	for(int i=1;i<=n;i++){
		cout<<a[i].f<<" ";
	}
	return 0;
}