#include<bits/stdc++.h>
#define ll long long
using namespace std;
const int maxn=500010;
inline ll read(){
	ll x=0,f=1;
	char ch=getchar();
	while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}
	while(ch>='0'&&ch<='9'){x=(x<<3)+(x<<1)+(ch-48);ch=getchar();}
	return x*f;
}
bool Mbe;

ll n,a[maxn],ans;
map<ll,int> t;
int tree[maxn*32][4],idx;
int sum[maxn*32];ll mul[maxn*32];
void clr(){
	for(int i=1;i<=idx;i++)tree[i][0]=tree[i][1]=tree[i][2]=tree[i][3]=sum[i]=mul[i]=0;
	idx=1;
}
void work(){
	n=read();ll ans=n*(n-1)*(n-2)/6;
	clr();t.clear();
	for(int i=1;i<=n;i++){
		a[i]=read();int num=++t[a[i]];int val=num-1;
		int nd=1;
		for(int j=0;j<60;j+=2){
			int c=(a[i]>>j)&3ll;
			sum[nd]++;mul[nd]+=val;
			if(!tree[nd][c])tree[nd][c]=++idx;
			nd=tree[nd][c];
		}
		sum[nd]++;mul[nd]+=val;
		nd=1;
		for(int j=0;j<60;j+=2){
			int c=(a[i]>>j)&3ll;
			ans-=1ll*(num-1)*sum[tree[nd][c^1]];
			ans-=1ll*(num-1)*sum[tree[nd][c^3]];
			ans-=mul[tree[nd][c^1]];
			ans-=mul[tree[nd][c^3]];
			nd=tree[nd][c];
		}
		ans-=(num-1)*(num-2)/2;
		// cout<<ressum<<" "<<resmul<<"\n";
	}
	printf("%lld\n",ans);
}

// \
444

bool Med;
int T;
signed main(){
	// freopen("game.in","r",stdin);
	// freopen("game.out","w",stdout);
	
//	ios::sync_with_stdio(0);
//	cin.tie(0);cout.tie(0);
	
	// cerr<<(&Mbe-&Med)/1048576.0<<" MB\n";
	
	T=read();
	while(T--)work();
}