1
#include<bits/stdc++.h>
2
using namespace std;
3

4
const int N = 1e5 + 10;
5

6
int n;
7
int a[N], tree[N];
8

9
int lowbit(int x) {
10
    return x & -x;
11
}
12

13
void add(int x, int v) {
14
    while(x <= n) {
15
        tree[x] += v;
16
        x += lowbit(x);
17
    }
18
}
19

20
int query(int x) {
21
    int res = 0;
22

23
    while(x) {
24
        res += tree[x];
25
        x -= lowbit(x);
26
    }
27

28
    return res;
29
}
30

31
int main() {
32

33
    cin >> n;
34
    vector<int> alls, res;
35

36
    for(int i = 0; i < n; i ++ ) {
37
        cin >> a[i];
38
        alls.push_back(a[i]);
39
    }
40

41
    sort(alls.begin(), alls.end());
42
    alls.erase(unique(alls.begin(), alls.end()), alls.end());
43

44
    for(int i = n - 1; i >= 0; i -- ) {
45
        int rk = lower_bound(alls.begin(), alls.end(), a[i]) - alls.begin() + 1;
46

47
        res.push_back(query(rk - 1));
48
        add(rk, 1);
49
    }
50

51
    reverse(res.begin(), res.end());
52

53
    for(auto& x : res) cout << x << " ";
54

55
    return 0;
56
}