#include<bits/stdc++.h>
using namespace std;
struct node{
	long long x,y;
	bool operator <(const node &t)const{
		return x>t.x;
	}
}a[200005];
map<long long,long long>b;
int main(){
	long long n;
	cin>>n;
	for(long long i=1;i<=n;i++){
		cin>>a[i].x;
		a[i].y=i;
	}
	sort(a+1,a+n+1);
	long long f=1;
	b[a[1].y]=0;
	for(long long i=2;i<=n;i++){
		if(a[i].x!=a[i-1].x){
			b[a[i].y]=a[i-1].y;
			f=i-1;
		}else{
			if(a[f].x==a[f-1].x) f--;
			b[a[i].y]=a[f].y;
		}
	}
	for(long long i=1;i<=n;i++) cout<<b[i]<<" "; 
	return 0;
}