#include<bits/stdc++.h>

#define ull unsigned long long
#define vc vector
#define pb emplace_back
#define pii pair<int, int>
#define mkp make_pair
#define rep(i, a, b) for(int i = (a); i <= (b); ++i)
#define lep(i, a, b) for(int i = (a); i >= (b); --i)

#define int long long

using namespace std;

inline int read() {
	int x = 0, w = 0; char ch = getchar(); while(!isdigit(ch)) w |= (ch == '-'), ch = getchar();
	while(isdigit(ch)) x = x * 10 + (ch ^ 48), ch = getchar(); return w ? -x : x; 
}

const int N = 2e5 + 5;
const ull Base = 19260817;

int n, ans, sum, a[N], K[N], B[N];
ull hs[N], pw[N];
char str[N];
unordered_map<int, int> f[N];

inline ull Hash(int l, int r, int u = 0, ull v = 0) { 
	ull res = hs[r] - hs[l - 1] * pw[r - l + 1];
	if(u >= l && u <= r) res += (v - a[u]) * pw[r - u];
	return res;
}

inline int lcp(int x, int y, int u = 0, ull v = 0) {
	int l = 0, r = min(n - y + 1, n - x + 1), mid;
	while(l <= r) {
		mid = l + r >> 1;
		if(Hash(x, x + mid - 1, u, v) == Hash(y, y + mid - 1, u, v)) l = mid + 1;
		else r = mid - 1;
	}
	return r;
}

inline void add(int l, int r, int k, int b) {
	K[l] += k; K[r + 1] -= k;
	B[l] += b; B[r + 1] -= b;
}

inline void testcase() {
	n = read(); ans = 0;
	rep(i, 0, n) f[i].clear(), K[i] = B[i] = 0;
	rep(i, 1, n) a[i] = read(), hs[i] = 1ull * Base * hs[i - 1] + a[i];
	
	sum = n;
	rep(i, 2, n) {
		int len = lcp(1, i), c; sum += len;
		add(1, min(len, i - 1), -1, len + 1);
		add(i, i + len - 1, -1, len + i);
		c = a[len + 1], f[i + len][c] += lcp(len + 2, i + len + 1, i + len, c) + 1;
		if(len < i) 
			c = a[i + len], f[len + 1][c] += lcp(len + 2, i + len + 1, len + 1, c) + 1;
	}
	
	for(int i = 1, k = 0, b = 0, res; i <= n; i++) {
		k += K[i]; b += B[i]; res = 0;
		for(auto u : f[i]) res = max(res, u.second);
		ans += (sum - k * i - b + res) ^ i;
	}
	printf("%lld\n", ans);
}

signed main() {
	pw[0] = 1; 
	rep(i, 1, N - 1) pw[i] = 1ull * Base * pw[i - 1];
	int t = read(); while(t--) testcase();
	return 0;
}