#include<cstdio>
#include <iostream>
#include<algorithm>
#include<string>
#include<queue>
#include<vector>
#include<functional>
#include<cmath>
#include<map>
#include<stack>
#include<set>
#include<numeric>

using namespace std;
typedef long long ll;
typedef pair<int, int> Pr;

ll N;
ll A[100010];

int main()
{
	cin >> N;

	ll k_score,rank=1;
	for (int i = 0; i < N; i++) {
		ll a;
		cin >> a;
		if (i == 0)k_score = a;
		if (k_score < a)rank++;
		A[i] = rank;
	}

	for (int i = 0; i < N; i++)
		cout << A[i] << endl;
	return 0;
}