#include<bits/stdc++.h> using namespace std; int main(){ int N; cin >> N; vector<int> scores(N), original(N); for(int i = 0; i < N; ++i) { cin >> scores[i]; original[i] = scores[i]; } sort(scores.begin(), scores.end(), greater<int>()); vector<int> rank(N); rank[0] = 1; for(int i = 1; i < N; ++i) { if(scores[i] == scores[i-1]) { rank[i] = rank[i-1]; } else { rank[i] = i + 1; } } for(int i = 0; i < N; ++i) { auto it = lower_bound(scores.begin(), scores.end(), original[i], greater<int>()); int pos = it - scores.begin(); cout << rank[pos] << endl; } return 0; }