def s(n,l):
	z=[0]*20
	l.sort(reverse=True);a=n
	A=[];c=1
	for i in range(n-1):
		if l[i]==l[i+1]:c+=1
		else:A+=[[l[i],c]];c=1
	A+=[[l[-1],c]];p=0
	for i in range(len(A)):
		a+=A[i][1]**2-A[i][1]
		t=format(A[i][0],'b').zfill(20);m=0
		for j in range(20):
			if t[j]=='0':z[j]+=2**i
			else:m|=z[j]
		u=bin(m)[2::];u=u[::-1]
		a+=p-sum([(u[k]=='1')*A[k][1] for k in range(len(u))])*A[i][1]
		p+=A[i][1]
	return a
for i in range(int(input())):
	n=int(input());l=[*map(int,input().split())]
	print(s(n,l))