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 n chips today, the i-th chip produced this day has a serial number si.
At theendoftheday, he packages all the chips produced this day, and send itto wholesalers. More specially, he writes a checksum numberonthe package, this checksum is defined asbelow:
maxi,j,k(si+sj)⊕sk
which i,j,k are three different integers between1and n. And ⊕ is symbol of bitwise XOR.
Can you help John calculate the checksum numberof today?
Input
The first line of input contains an integer T indicating the total numberof test cases.
The first line of each test case is an integer n, indicating thenumberof chips produced today. The next line has n integers s1,s2,..,sn, separated with single space, indicating serial numberof each chip.
1≤T≤10003≤n≤10000≤si≤109
There are at most 10 testcases with n>100
Output
For each test case, please output an integer indicating the checksum numberin a line.
Sample Input
231233100200300
Sample Output
6400
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 n