#include<algorithm>
#include<cstdio>
using namespace std;
int n,cnt,a[100001],bin[100001];
int main(){
	scanf("%d",&n);
	for(int i=1;i<=n;i++)scanf("%d",&a[i]);
	for(int i=1;i<=n;i++)bin[++cnt]=a[i];
	sort(bin+1,bin+cnt+1);
	cnt=unique(bin+1,bin+cnt+1)-bin-1;
	for(int i=1;i<=n;i++)a[i]=lower_bound(bin+1,bin+cnt+1,a[i])-bin;
}