#include <iostream>
#include <algorithm>
#include <unordered_map>
using namespace std;
int a[500000], b[500000];
int main(){
    cin.tie(0), ios_base::sync_with_stdio(false); 
    int n;
    cin >> n;
    for(int i=0; i<n; ++i) cin >> a[i];
    long long r = 0;
    for(int i=29; i>=0; --i){
        unordered_map<int,int> c(n);
        for(int j=0; j<n; ++j){
            if(!(a[j]>>i&1)) r += c[a[j]>>i+1];
            else c[a[j]>>i+1] += 1;
        }
    }
    for(int i=0; i<n; ++i) b[i] = a[i];
    sort(b, b+n);
    for(int i=0; i<n; ++i){
        cout << r << endl;
        int l = lower_bound(b, b+n, a[i]) - b;
        int u = upper_bound(b, b+n, a[i]) - b;
        r += (n-u) - l;
    }
    return 0;
}