You are given an array A of size N. Now, we call the value of an array the BItwise XOR of all elements it contains. For example, the value of the array $[1,2,3]$ = $1 \oplus 2 \oplus 3$. Now, You are required to find the Bitwise XOR of the value of all sub arrays of array A. Can you do it ?

Input:

First line of input contains a single integer T denoting the number of test cases. First line of each test case starts with an integer N denoting the size of the array A. Next line of input contains N space separated integers, where the ith integer denotes the value $A[i]$.

Output:

For each of the test case, print the output in a separate line.

Constraints:

$1 \le T \le 20$

$1 \le N \le 10^5$

$1 \le A[i] \le 10^6$