B - Johnny and His Hobbies CodeForces - 1362B

CodeForces - 1362B

Among Johnny's numerous hobbies, there are two seemingly harmless ones: applying bitwise operations and sneaking into his dad's office. As it is usually the case with small children, Johnny is unaware that combining these two activities can get him in a lot of trouble.

There is a set SS containing very important numbers on his dad's desk. The minute Johnny heard about it, he decided that it's a good idea to choose a positive integer kk and replace each element ss of the set SS with s⊕ks⊕k (⊕⊕ denotes the exclusive or operation).

Help him choose such kk that Johnny's dad will not see any difference after his son is done playing (i.e. Johnny will get the same set as before playing). It is possible that no such number exists. It is also possible that there are many of them. In such a case, output the smallest one. Note that the order of elements in a set doesn't matter, i.e. set {1,2,3}{1,2,3} equals to set {2,1,3}{2,1,3}.

Formally, find the smallest positive integer kk such that {s⊕k|s∈S}=S{s⊕k|s∈S}=S or report that there is no such number.

For example, if S={1,3,4}S={1,3,4} and k=2k=2, new set will be equal to {3,1,6}{3,1,6}. If S={0,1,2,3}S={0,1,2,3} and k=1k=1, after playing set will stay the same.

Input

In the first line of input, there is a single integer tt (1≤t≤10241≤t≤1024), the number of test cases. In the next lines, tt test cases follow. Each of them consists of two lines.

In the first line there is a single integer nn (1≤n≤10241≤n≤1024) denoting the number of elements in set SS. Second line consists of nn distinct integers sisi (0≤si<10240≤si<1024), elements of SS.

It is guaranteed that the sum of nn over all test cases will not exceed 10241024.

Output

Print tt lines; ii-th line should contain the answer to the ii-th test case, the minimal positive integer kk satisfying the conditions or −1−1 if no such kk exists.

Example

Input

6
4
1 0 2 3
6
10 7 14 8 3 12
2
0 2
3
1 2 3
6
1 4 6 10 11 12
2
0 1023

Output

1
4
2
-1
-1
1023

Note

In the first test case, the answer is 11 because it is a minimum positive integer and it satisfies all the conditions.

题意：t组输入，每组给定n个数字，要求对所有数字与k进行异或运算，使得得到的所有结果与原有所有数字为相同内容。

题解：因为数据也不是很大，所以我就直接暴力枚举了（勉强挤出笑容.JPG）

#include<iostream>
#include<algorithm>
using namespace std;

int t, n;
int main(){
	scanf("%d", &t);
	while(t--){
		scanf("%d", &n);
		int s[1050], a[1050]={0};
		int maxx=0, flag=-1;
		for(int i=0; i<n; i++){
			scanf("%d", s+i);
			if(s[i] > maxx)	maxx = s[i];
			a[s[i]]++;
		}
		for(int k=1; k<=1024; k++){
			int b[1050]={0};
			for(int i=0; i<n; i++){
				int x = s[i]^k;
				b[x]++;
			}
			for(int i=0; i<=1024; i++){
				if(a[i]!=b[i])	break;
				if(i==maxx && a[i]==b[i])	flag = k;
			}	
			if(flag!=-1)	break;
		}
		printf("%d\n", flag);
	}
	return 0;
}