#include<bits/stdc++.h>
using namespace std;
int a[100010],b[100010];
int main(){
int n;
scanf("%d", &n);
for(int i=1;i<=n;i++){
scanf("%d", &a[i]);
b[i]=a[i];
}
sort(b+1, b+1+n);
int m=unique(b+1, b+1+n)-b-1;
for(int i=1;i<=n;i++){
int x=lower_bound(b+1, b+1+m,a[i])-b;
cout<<x<<" ";
}
return 0;
}