#include <bits/stdc++.h>
using namespace std;
int arr[200000];
int brr[200000];
int main() {
	int n;
	cin>>n;
	for(int i=1;i<=n;i++){//10w
		cin>>arr[i];
	}
	memcpy(brr,arr,sizeof(arr));
	sort(arr+1,arr+1+n);;//升序排序
	int pm = 1;
	//int fs = arr[n];//100
	for(int i= 1;i<=n;i++){// brr[i] 要查的分数
		int* t = upper_bound(arr+1,arr+1+n,brr[i]);
		if(t == arr+1+n){
			cout<<1<<endl;
		}else {
			int pm = arr+n - t  + 1;
			cout<<pm+1<<endl;
		}
	}

	return 0;
}