While Avengers are fighting among each other, Thanos is trying to collect all infinity stones. In his quest, he got some encrypted information about the locations of infinity stones. For each possible location of an Infinity stone, he is given an integer array A of size n and decryption key is the number of subarrays [i,j] for which following condition is true:

(A[i] & A[i+1] &...A[j]) = min(A[i],A[i+1],....,A[j])

Since Thanos is busy planning to destroy the Avengers, he wants you to find the decryption key for him.

Input
First line contains t: No. of possible locations of stones.
First line of each possible location contains n: size of array A.
Next line contains n integers A[i].

Output
For each possible location output decryption key in new line.

Constraints
1 <= t <= 10
1 <= n <= 2*10⁵
1 <= A[i] <= 10⁹

Sample Input:
1
3
1 2 3

Sample Output
4