#include<bits/stdc++.h>
using namespace std;
long long n,res[100005];
pair<long long, long long> a[100005];
bool cmp(pair<long long,long long> x, pair<long long,long long> y)
{
    return x.first>y.first;
}
int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    if (fopen("bxh.inp", "r"))
    {
        freopen("bxh.inp", "r", stdin);
        freopen("bxh.out", "w", stdout);
    }
    cin >> n;
    for (long long i=1; i<=n; i++)
    {
        cin >> a[i].first;
        a[i].second=i;
    }
    sort (a+1,a+1+n,cmp);
    res[a[1].second]=1;
    for (long long i=2; i<=n; i++)
    {
        if(a[i].first!=a[i-1].first)
        {
            res[a[i].second]=i;  
        }
        else
        {
            res[a[i].second]=res[a[i-1].second];
        }
    }
    for (long long i=1; i<=n; i++)
    {
        cout << res[i] << " ";
    }
}