Hello Community!

So problem was like this —

find x in such way that after performing Xor operation with each element of given array the sum of array is maximized and if the there are more than one x which is giving the maximum array sum (after operation) then we have to return the minimum x.

x can be upto 2^63.

input

1

5

10 12 5 7 19

output

92233720368…(some 18 digit number, i don’t remember)

How can i solve this?