#include<iostream>
#include<cstdio>
#include<algorithm>
#include<map>
#define N 1000000
using namespace std;
long long read()
{
	char c=0;
	long long sum=0;
	while (c<'0'||c>'9') c=getchar();
	while ('0'<=c&&c<='9') sum=sum*10+c-'0',c=getchar();
	return sum;
}
struct reads
{
	long long num;
	int data;
};
reads tong[N+1],tong2[N+1];
int T,n,length,length2;
long long a[N+1],ans;
int main()
{
	int pv,res;
	long long res2;
	T=read();
	while (T--)
	{
		n=read(),ans=1ll*n*(n-1)*(n-2)/6,pv=1,length=res=res2=0;
		for (int i=1;i<=n;++i) a[i]=read();
		sort(a+1,a+n+1);
		for (int i=1;i<=n;++i)
			if (i==n||a[i]!=a[i+1])
				tong[++length]=(reads){a[i],i-pv+1},pv=i+1;
		for (int i=1;i<=length;++i) ans-=1ll*tong[i].data*(tong[i].data-1)*(tong[i].data-2)/6;
		for (int i=0;i<=59;++i)
		{
			if (i)
			{
				length2=0;
				for (int j=1;j<=length;++j)
					if (!(tong[j].num&(1ll<<(i-1))))
						tong2[++length2]=tong[j];
				for (int j=1;j<=length;++j)
					if (tong[j].num&(1ll<<(i-1)))
						tong2[++length2]=tong[j];
				length=length2;
				for (int j=1;j<=length;++j) tong[j]=tong2[j];
			}
			res=res2=0;
			for (int j=1;j<=length;++j)
			{
				if (!(i&1)) ans-=res*((1ll*tong[j].data*(tong[j].data-1))>>1)+res2*tong[j].data;
				else ans+=res*((1ll*tong[j].data*(tong[j].data-1))>>1)+res2*tong[j].data;
				if (j==length||(tong[j].num&((1ll<<i)-1))!=(tong[j+1].num&((1ll<<i)-1))) res=res2=0;
				else res+=tong[j].data,res2+=((1ll*tong[j].data*(tong[j].data-1))>>1);
			}
		}
		printf("%lld\n",ans);
	}
	return 0;
}