//qoj8077
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;

const int N = 1e6 + 10;
int T, n, cnt[N], ps[N];
ll a[N], b[N];

ll clc(ll x){
    return x * (x-1) * (x-2) / 6;
}

int ch[N*64][2], siz[N*64], tt;
void ins(ll x){
    int p = 0;
    ++ siz[p];
    for(ll i = 0; i <= 62; ++ i){
        if(!ch[p][(x>>i)&1]){
            ch[p][(x>>i)&1] = ++ tt;
        }
        p = ch[p][(x>>i)&1];
        ++ siz[p];
    }
}
void qry(ll x, ll &ans){
    int p = 0, op = 1;
    ans += siz[p] * op;
    op *= -1;
    for(ll i = 0; i <= 62; ++ i){
        p = ch[p][(x>>i)&1];
        ans += siz[p] * op;
        op *= -1;
    }
}

int main(){
    scanf("%d", &T);
    while(T--){
        scanf("%d", &n);
        ll ans = clc(n);
        for(int i = 1; i <= n; ++ i){
            scanf("%lld", &a[i]);
            b[i] = a[i];
            ins(a[i]);
        }
        sort(b + 1, b + n + 1);
        int m = unique(b + 1, b + n + 1) - b - 1;
        for(int i = 1; i <= n; ++ i){
            ps[i] = lower_bound(b + 1, b + m + 1, a[i]) - b;
            ++ cnt[ps[i]];
        }
        for(int i = 1; i <= n; ++ i){
            int p = ps[i];
            if(cnt[p]){
                ll cc = cnt[p], dd = 0;
                cnt[p] = 0;
                qry(a[i], dd);
                ans -= dd * cc * (cc-1) / 2 + clc(cc);
            }
        }
        printf("%lld\n", ans);
        for(int i = 0; i <= tt; ++ i){
            ch[i][0] = ch[i][1] = siz[i] = 0;
        }
        for(int i = 0; i <= n; ++ i){
            cnt[i] = 0;
        }
        tt = 0;
    }
    return 0;
}