#include <bits/stdc++.h>
using namespace std;
typedef long long ll;

inline int rd() {
	int x = 0;
	bool f = false;
	char c = getchar();
	for (; !isdigit(c); c = getchar()) f |= (c == '-');
	for (; isdigit(c); c = getchar()) x = x * 10 + (c ^ 48);
	return f ? -x : x;
}

#define fr     first
#define sc     second
#define pb     push_back
#define mp     make_pair
#define pii    pair<int, int>
#define all(x) (x).begin(), (x).end() 

#define N 1000007

int cnt[N];

int gcd(int a, int b) {return b ? gcd(b, a % b) : a;}

inline void work() {
	int n = rd();
	memset(cnt, 0, sizeof(cnt));
	for (int i = 1; i <= n; ++i) ++cnt[rd()];
	ll ans = 0;
	for (int d = 1; d < N; ++d)
		for (int i = d; i < N; i += d) {
			int tar = i ^ d;
			if (tar >= N) continue;
			if (cnt[tar] && gcd(tar, i) == d) ans += 1ll * cnt[i] * cnt[tar];
		}
	printf("%lld\n", ans / 2);
}

int main() {
	for (int t = rd(); t; --t) work();
	return 0;
}