#include<iostream>
#include<algorithm>
using namespace std;
struct Data{
	int num,ra,ind;
}d[10];
bool cmpn(Data a,Data b){
	return a.num<b.num;
}
bool cmpi(Data a,Data b){
	return a.ind<b.ind;
}
int main()
{
	int n,count=0;
	cout<<"请输入整数的个数："<<endl;
	cin>>n;
	cout<<"请输入所有整数："<<endl;
	for(int i=0;i<n;i++){
		cin>>d[i].num;
		d[i].ind=i+1;
	} 
	sort(d,d+n,cmpn);
	for(int i=0;i<n;i++){
		if(d[i].num!=d[i-1].num){
			d[i].ra=++count;
		}else if(d[i].num==d[i-1].num){
			d[i].ra=count;
		}
	}
	for(int j=1;j<=n;j++){
		for(int i=0;i<n;i++){
			if(j==d[i].ind){
				cout<<d[i].ra<<" ";
			}
		}
	}
	cout<<endl;
}