#include<iostream>
#include<vector>
#include<algorithm>

using namespace std;

typedef long long ll;

int main() {

	int n = 0;
	cin >> n;
	vector<ll> ranking,array;
	int k_ranking = 1;
	int k_score = 0;
	for (int i = 0;i < n;i++) {
		ll buff = 0;
		cin >> buff;
		array.push_back(buff);
	}
	for (int i = 0;i < n;i++) {
		ll buff = 0;
		buff = array[i];
		ranking.push_back(buff);
		if (ranking.size() == 1) {
			k_score = buff;
			cout << 1 << endl;
			continue;
		}
		sort(ranking.begin(), ranking.end(),greater<ll>());
		auto itr = find(ranking.begin(),ranking.end(),k_score);
		int index = distance(ranking.begin(),itr);
		cout << index + 1 << endl;
	}


	return 0;
}