#include <iostream>
#include <algorithm>
#include <vector>
using namespace std;

template<class T> inline void YES(T condition){ if(condition) cout << "YES" << endl; else cout << "NO" << endl; }
template<class T> inline void Yes(T condition){ if(condition) cout << "Yes" << endl; else cout << "No" << endl; }
template<class T> inline void POSS(T condition){ if(condition) cout << "POSSIBLE" << endl; else cout << "IMPOSSIBLE" << endl; }
template<class T> inline void Poss(T condition){ if(condition) cout << "Possible" << endl; else cout << "Impossible" << endl; }
template<class T> inline void First(T condition){ if(condition) cout << "First" << endl; else cout << "Second" << endl; }
int character_count(string text, char character){ int ans = 0; for(int i = 0; i < text.size(); i++){ ans += (text[i] == character); } return ans; }
long power(long base, long exponent, long module){ if(exponent % 2){ return power(base, exponent - 1, module) * base % module; }else if(exponent){ long root_ans = power(base, exponent / 2, module); return root_ans * root_ans % module; }else{ return 1; }}
struct position{ int y, x; }; position move_pattern[4] = {{-1, 0}, {0, 1}, {1, 0}, {0, -1}}; // double euclidean(position first, position second){ return sqrt((second.x - first.x) * (second.x - first.x) + (second.y - first.y) * (second.y - first.y)); }
template<class T, class U> string to_string(pair<T, U> x){ return to_string(x.first) + "," + to_string(x.second); }
template<class itr> void array_output(itr start, itr goal){ string ans; for(auto i = start; i != goal; i++){ ans += to_string(*i) + " "; } ans.pop_back(); cout << ans << endl; }
template<class T> T gcd(T a, T b){ if(a && b){ return gcd(min(a, b), max(a, b) % min(a, b)); }else{ return a; }} template<class T> T lcm(T a, T b){ return a / gcd(a, b) * b; }
#define mod long(1e9 + 7)
#define all(x) (x).begin(), (x).end()
#define bitcount(n) __builtin_popcountl(long(n))

template< class T >
struct BinaryIndexedTree
{
    vector< T > data;
    
    BinaryIndexedTree(int sz)
    {
        data.assign(++sz, 0);
    }
    
    T sum(int k)
    {
        T ret = 0;
        for(++k; k > 0; k -= k & -k) ret += data[k];
        return (ret);
    }
    
    void add(int k, T x)
    {
        for(++k; k < data.size(); k += k & -k) data[k] += x;
    }
};

int main(){
    int N;
    cin >> N;
    int nums[N];
    pair<int, int> sorted_nums[N];
    for(int i = 0; i < N; i++){
        cin >> nums[i];
        sorted_nums[i] = {nums[i], i};
    }
    sort(sorted_nums, sorted_nums + N, greater<>());
    int sorted_nums_array[N];
    for(int i = 0; i < N; i++){
        sorted_nums_array[i] = sorted_nums[i].first;
    }
    BinaryIndexedTree<int> bubble_sort_tree(N);
    long ans = 0;
    for(int i = 0; i < N; i++){
        ans += bubble_sort_tree.sum(sorted_nums[i].second);
        bubble_sort_tree.add(sorted_nums[i].second, 1);
    }
    reverse(sorted_nums_array, sorted_nums_array + N);
    for(int i = 0; i < N; i++){
        cout << ans << endl;
        ans += (sorted_nums_array + N - upper_bound(sorted_nums_array, sorted_nums_array + N, nums[i])) - (lower_bound(sorted_nums_array, sorted_nums_array + N, nums[i]) - sorted_nums_array);
    }
}