#include<bits/stdc++.h>
using namespace std;
using ll=long long;
const int N=5e5+10;
int T,n;
ll a[N];
ll C2(int x){
    return x*(x-1ll)/2;
}
ll C3(int n){
    return n*(n-1ll)*(n-2)/6;
}
void work(){
    scanf("%d",&n);
    for(int i=1;i<=n;i++){
        ll x;
        scanf("%lld",&x);
        a[i]=0;
        for(int j=0;j<60;j++)if(x>>j&1){
            a[i]|=1ll<<60-1-j;
        }
    }
    sort(a+1,a+1+n);
    ll ans=0;
    for(int l=1,r;l<=n;l=r){
        for(r=l+1;r<=n&&a[l]==a[r];r++);
        ans+=(r-l)*(l-1ll)*(n-r+1);
        // cerr<<ans<<endl;
    }
    for(int k=0;2*k+1<=60;k++){
        int t=60-(2*k+1);
        for(int l=1,r;l<=n;l=r){
            for(r=l+1;(a[l]>>t)==(a[r]>>t);r++);
            ll w[2]={0,0};
            for(int i=l,j;i<r;i=j){
                for(j=i+1;j<r&&a[j]==a[i];j++);
                w[a[i]>>t-1&1]+=C2(j-i);
            }
            for(int i=l;i<r;i++){
                ans+=w[~a[i]>>t-1&1];
            }
        }
    }
    printf("%lld\n",ans);
}
int main(){
    for(scanf("%d",&T);T--;)work();
    return 0;
}