write a go solution for Description:
You are given an integer array a_1,a_2,...,a_n (1<=a_i<=n).

Find the number of subarrays of a whose operatornameXOR has an even number of divisors. In other words, find all pairs of indices (i,j) (i<=j) such that a_ioplusa_i+1oplus...oplusa_j has an even number of divisors.

For example, numbers 2, 3, 5 or 6 have an even number of divisors, while 1 and 4 — odd. Consider that 0 has an odd number of divisors in this task.

Here operatornameXOR (or oplus) denotes the bitwise XOR operation.

Print the number of subarrays but multiplied by 2022... Okay, let's stop. Just print the actual answer.

Input Format:
Each test contains multiple test cases. The first line contains the number of test cases t (1<=t<=10^4). Description of the test cases follows.

The first line of each test case contains a single integer n (2<=n<=2*10^5) — the length of the array a.

The second line contains n integers a_1,a_2,...,a_n (1<=a_i<=n).

It is guaranteed that the sum of n over all test cases does not exceed 2*10^5.

Output Format:
For each test case, print the number of subarrays, whose operatornameXOR has an even number of divisors.

Note:
In the first test case, there are 4 subarrays whose operatornameXOR has an even number of divisors: [3], [3,1], [1,2], [2].

In the second test case, there are 11 subarrays whose operatornameXOR has an even number of divisors: [4,2], [4,2,1], [4,2,1,5], [2], [2,1], [2,1,5], [2,1,5,3], [1,5,3], [5], [5,3], [3].

In the third test case, there is no subarray whose operatornameXOR has an even number of divisors since operatornameXOR of any subarray is either 4 or 0.. Output only the code with no comments, explanation, or additional text.