#include <cstdio>

#include <cstring>

#include <iostream>

#include <algorithm>

#include <queue>

#include <stack>

#include <cstdio>

#include <iostream>

#include <cstring>

#include <algorithm>

#include <string>

using namespace std;

int n,ans[];

struct node

{

    int x, id;

}e[];

bool cmp(node a, node b)

{

    return a.x > b.x;

}

int main()

{

    scanf("%d", &n);

    for (int i = ; i <= n; i++)

    {

        scanf("%d", &e[i].x);

        e[i].id = i;

    }

    sort(e + , e +  + n, cmp);

    for (int i = ; i <= n; i++)

    {

        ans[e[i].id] = i;

        for (int j = i - ; j >= ; j--)

            if (e[j].x == e[i].x)

                ans[e[i].id]--;

    }

    for (int i = ; i <= n; i++)

        printf("%d ", ans[i]);

    return ;

}