#include<iostream>
#include<array>
#include<algorithm>
#include<cmath>
#include<random>
#include<ctime>
#include<iomanip>
using namespace std;
using gg=long long;
mt19937 RND(time(0));
gg MAX=10000000;
array<gg,2000010> num,tp;
inline gg gcd(const gg &a,const gg &b){return b==0?a:gcd(b,a%b);}
inline gg rnd(const gg &l,const gg &r){
	return RND()%(r-l+1)+l;
}
int main(){
	ios::sync_with_stdio(false);
	cin.tie(0);
	gg T,n,t,tmp;
	double ans;
	cin>>T;
	MAX/=T;
	for(gg i=1;i<=2000000;i++){
		tp[i]=tp[i-1]+i-1;
	}
	while(T--){
		cin>>n;
		if(n==1){
			cout<<0<<'\n';
			continue;
		}
		tmp=0;
		for(gg i=1;i<=n;i++){
			cin>>num[i];
		}
		for(gg i=1;i<=MAX;i++){
			gg x=rnd(1,n);
			gg y=rnd(1,n);
			while(x==y) y=rnd(1,n);
			if(y<x) swap(x,y);
			if(gcd(num[x],num[y])==(num[x]^num[y])) tmp++;
		}
		ans=double(tmp)/MAX;
		cout<<gg(round(ans*tp[n]))<<'\n';
	}
	return 0;
}