选择一个数x,对原来的数组每个数进行异或运算,得到全新的数组bi,bi=ai ^x
是否能使得b1 ^ b2 ^b3 =0
输入
5
3
1 2 5
3
1 2 3
4
0 1 2 3
4
1 2 2 3
1
1
输出
6
0
3
-1
1
#include <iostream>
#include <vector>
#include <bits/stdc++.h>
#include <unordered_map>
#include <queue>
#include <algorithm>
#define x first
#define y second
#define pb emplace_back
#define fu(i,a,b) for(int i=a;i<=b; ++ i)
#define fd(i,a,b) for(int i=a;i>=b; -- i)
#define endl '\n'
#define ms(x,y) memset(x,y,sizeof x)
#define ios ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);
using namespace std;
typedef long long LL;
typedef unsigned long long ULL;
typedef vector<vector<LL>> VVL;
typedef vector<vector<int>> VVI;
typedef vector<LL> VL;
typedef vector<int> VI;
typedef vector<string> VS;
typedef pair<int,int> PII;
typedef vector<PII> VPII;
typedef pair<PII,int> PIII;
typedef pair<double,double> PDD;
typedef pair<double,int> PDI;
typedef pair<char,int> PCI;
typedef pair<string,int> PSI;
typedef pair<int,string> PIS;
typedef pair<int,char> PIC;
typedef pair<LL,LL> PLL;
typedef __int128 i128;
typedef unsigned long long ULL;
const int N =1e3+ 10,M = N *4,INF = 0x3f3f3f3f,P = 131;
const double eps = 1e-8;
const int mod = 998244353,base= 20010;
const LL LNF=(LL) INF * INF;
inline void solve()
{
int n ; cin >> n ;
int s= 0;
fu(i,0,n-1)
{
int x;cin >> x ;
s ^=x;
}
if(n & 1 ) cout << s << endl;
else if(s == 0) cout << 0 << endl;
else cout << -1 <<endl;
}
signed main()
{
// freopen("1.txt","r",stdin);
// #define int long long
// init(N-1);
// ios
// cout << fixed<<setprecision(2);
int t=1;
cin>>t;
int now = 1;
while(t -- )
{
// cout<<"Case ";
// cout<<"Case #";
// cout<<"Scenario #";
// cout<< now ++ <<": ";
// cout<< now ++ <<": \n";
solve();
}
return 0;
}