/<> 2517 (top down segment tree)

#include <iostream>
#include <string>
#include <cstring>
#include <algorithm>
#include <cmath>
#include <vector>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <deque>
#include <unordered_map>
#include <numeric>
#include <iomanip>
using namespace std;
#define pii pair<long long, long long>
#define ll long long
#define FAST ios_base::sync_with_stdio(false); cin.tie(NULL)
const long long dx[4] = {0, 1, 0, -1}, dy[4] = {1, 0, -1, 0};
const long long dl[2] = {1, -1};
const long long MOD = 1000000007;
const long long MAXN = 500005;

int N;
int before[MAXN], arr[MAXN], seg[MAXN * 4], loc[MAXN], best[MAXN];
vector<int> tmp;

void update(int x, int s, int e, int idx, int val){
    if(idx < s or idx > e) return;
    if(s == e){
        seg[x] = val;
        return;
    }
    int mid = (s + e)/2;
    update(x * 2, s, mid, idx, val);
    update(x * 2 + 1, mid + 1, e, idx, val);
    seg[x] = seg[x * 2] + seg[x * 2 + 1];
}

int query(int x, int s, int e, int a, int b){
    if(b < s or e < a) return 0;
    if(a <= s and e <= b) return seg[x];
    int mid = (s + e)/2;
    return query(x * 2, s, mid, a, b) + query(x * 2 + 1, mid + 1, e, a, b);
}

int main() {
    FAST;
    cin >> N;
    for(int i = 1; i <= N; i++){
        cin >> before[i];
        tmp.push_back(before[i]);
    }
    sort(tmp.begin(), tmp.end());
    for(int i = 1; i <= N; i++){
        arr[i] = (int) (std::lower_bound(tmp.begin(), tmp.end(), before[i]) - tmp.begin()) + 1;
        loc[arr[i]] = i;
    }
    for(int i = 1; i <= N; i++){
        best[i] = loc[i] - query(1, 1, N, 1, loc[i] - 1);
        update(1, 1, N, loc[i], 1);
    }
    for(int i = 1; i <= N; i++){
        cout << best[arr[i]] << "\n";
    }
}