write a go solution for Description:
You are given an array a_1,a_2,ldots,a_n. Find the number of tuples (x,y,z) such that:

- 1<=x<=y<=z<=n, and
- f(x,y)oplusf(y,z)>f(x,z).

We define f(l,r)=a_loplusa_l+1oplusldotsoplusa_r, where oplus denotes the bitwise XOR operation.

Input Format:
The first line contains a single integer t (1<=t<=10^4) — the number of test cases.

The first line of each test case contains a single integer n (1<=n<=10^5).

The second line of each test case contains n integers a_1,a_2,ldots,a_n (1<=qa_i<=q10^9).

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

Output Format:
For each test case, output a single integer on a new line — the number of described tuples.

Note:
In the first case, there are 4 such tuples in the array [6,2,4]:

- (1, 2, 2): (a_1oplusa_2)oplus(a_2)=4oplus2>(a_1oplusa_2)=4
- (1, 1, 3): (a_1)oplus(a_1oplusa_2oplusa_3)=6oplus0>(a_1oplusa_2oplusa_3)=0
- (1, 2, 3): (a_1oplusa_2)oplus(a_2oplusa_3)=4oplus6>(a_1oplusa_2oplusa_3)=0
- (1, 3, 3): (a_1oplusa_2oplusa_3)oplus(a_3)=0oplus4>(a_1oplusa_2oplusa_3)=0

In the second test case, there are no such tuples.. Output only the code with no comments, explanation, or additional text.