John is a manager of a CPU chip factory, the factory produces lots of chips everyday. To manage large amounts of products, every processor has a serial number. More specifically, the factory produces nn chips today, the i-th chip produced this day has a serial number si​.

At the end of the day, he packages all the chips produced this day, and send it to wholesalers. More specially, he writes a checksum number on the package, this checksum is defined as below:

\display  maxi,j,k​(si​+sj​)⊕sk​

whichi,j,k are three different integers between 1 and n. And \oplus⊕ is symbol of bitwise XOR.

Can you help John calculate the checksum number of today?

Input Format

The first line of input contains an integer T indicating the total number of test cases.

The first line of each test case is an integer n, indicating the number of chips produced today.

The next line has nn integers s1​,s2​,..,sn​, separated with single space, indicating serial number of each chip.

1≤T≤1000

3≤n≤1000

0≤si​≤109

• There are at most 10 testcases with n>100

Output Format

For each test case, please output an integer indicating the checksum number in a line.

 #include <iostream>

 #include <algorithm>

 #include <cstring>

 #include <cstdio>

 #include <vector>

 #include <queue>

 #include <stack>

 #include <cstdlib>

 #include <iomanip>

 #include <cmath>

 #include <cassert>

 #include <ctime>

 #include <map>

 #include <set>

 using namespace std;

 #define  ull unsigned  long  long

 #define ll  long  long

 #define  N  30009

 int num[N],tree[N][];

 int t,n,a[];

 int pos;

 //01字典树

 void  insert(int x,int rt)

 {

     for(int i=;i>=;i--)

     {

         int y=;

         if(x>>i&)  y=;

         if(!tree[rt][y])  tree[rt][y]=pos++;

         rt=tree[rt][y];

         num[rt]++;

     }

 }

 void  dele(int x,int rt)

 {

     for(int i=;i>=;i--)

     {

         int y=;

         if(x>>i&) y=;

         rt=tree[rt][y];

         num[rt]--;//tree[rt][y] 还在，并不是真正的删除

     }

 }

 int solve(int x,int rt)

 {

     int ret=;

     /*

     00001010

     10100100是倒着来的

     那么只要字典树里首位有1，就不可能找到10100100

     */

     for(int i=;i>=;i--)//一定要倒过来，因为贪心，高位大，最终的结果才大

     {

         int y=;

         if(x>>i&) y=;

         if(tree[rt][y^]&&num[tree[rt][y^]])//num[tree[rt][y^1]]才有意义  {

             rt=tree[rt][y^];

             ret+=(<<i);//该位的异或为1

         }

         else{

             rt=tree[rt][y];

         }

     }

     return ret;

 }

 int  main()

 {

     scanf("%d",&t);

     while(t--)

     {

         for(int i=;i<N;i++)

         {

             num[i]=;

             for(int j=;j<=;j++)

             {

                 tree[i][j]=;

             }

         }

         pos=;

         scanf("%d",&n);

         for(int i=;i<n;i++){

             scanf("%d",&a[i]);

             insert(a[i],);

         }

         int ans=;

         //每次要删除a[i],a[j] 因为i!=j!=k

         //当然每次查询后，还要再次插入字典树

         for(int i=;i<n;i++)

         {    dele(a[i],);

             for(int j=i+;j<n;j++)

             {

                 dele(a[j],);

                 ans=max(ans,solve(a[i]+a[j],) );

                 insert(a[j],);

             }

             insert(a[i],);

         }

         printf("%d\n",ans);

     }

     return ;

 }

 //9s  的暴力解法

 #define  N  1009

 int t,n,a[N];

 int ans;

 int solve(int x,int y,int z)

 {

     return (x+y)^z;

 }

 int main()

 {

     scanf("%d",&t);

     while(t--)

     {

         scanf("%d",&n);

         for(int i=;i<n;i++)

         {

             scanf("%d",&a[i]);

         }

         int ans=;

         for(int i=;i<n;i++)

         {

             for(int j=i+;j<n;j++)

             {

                 for(int k=j+;k<n;k++)

                 {

                     ans=max(ans,solve(a[i],a[j],a[k]) );

                     ans=max(ans,solve(a[i],a[k],a[j]) );

                     ans=max(ans,solve(a[k],a[j],a[i]) );

                 }

             }

         }

         printf("%d\n",ans);

     }

     return  ;

 }