#include <bits/stdc++.h>

using namespace std;

#define FOR(i, a, b) for(int i = (a); i < (b); i++)
#define RFOR(i, a, b) for(int i = (a) - 1; i >= (b); i--)
#define SZ(a) int(a.size())
#define ALL(a) a.begin(), a.end()
#define PB push_back
#define MP make_pair
#define F first
#define S second

typedef long long LL;
typedef vector<int> VI;
typedef pair<int, int> PII;
typedef double db; 

const int LOG = 62;


void solve()
{
	LL n;
	cin >> n;
	map<LL, LL> cnt;

	vector<LL> a(n);
	FOR(i, 0, n)
	{
		cin >> a[i];
		cnt[a[i]]++;
	}
	
	map<LL, LL> CNT[LOG];
	FOR(i, 0, n)
	{
		FOR(k, 0, LOG)
		{
			if(k % 2 == 1)
				continue;
			LL val = a[i] & ((1LL << (k + 1)) - 1);
			CNT[k][val]++;
		}
	}
	LL ans = n * (n - 1) * (n - 2) / 6;
	for(auto [y, num] : cnt)
	{
		LL cur = num * (num - 1) / 2;
		
		LL sum = 0;
		FOR(k, 0, LOG)
		{
			if(k % 2 == 1)
				continue;
			LL val = y & ((1LL << (k + 1)) - 1);
			val ^= (1LL << k);
			
			sum += CNT[k][val];
		}
		ans -= cur * sum;
		ans -= num * (num - 1) * (num - 2) / 6;
	}
	cout << ans << "\n";
}



int main()
{
	ios::sync_with_stdio(0);
	cin.tie(0);
	
	int t;
	cin >> t;
	while(t--)
		solve();

	
	return 0;
}