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

using namespace std;

int main(void)
{
    int n;
    cin >> n;

    vector<int> a(n);
    for (int i = 0; i < n; i++) {
        cin >> a[i];
    }

    vector<int> sorted_a = a;
    sort(sorted_a.begin(), sorted_a.end());

    for (int i = 0; i < n; i++) {
        auto it = lower_bound(sorted_a.begin(), sorted_a.end(), a[i]);
        cout << it - sorted_a.begin() << " ";
    }
    cout << endl;
    
    return 0;
}