Given an array A of length n(n≤105, ai<250), divide it into two subsequences X and Y such that (x1⊕x2...) + (y1⊕y2...) is maximum. Print the maximum xor_sum(X) + xor_sum(Y).

Any help would be appreciated. Thanks!