Given an array of $n$ integers, your task is to find the maximum xor sum of a subarray.
The first line has an integer $n$ : the size of the array.
The next line has $n$ integers $x_1,x_2,\dots,x_n$ : the contents of the array.
Print one integer: the maximum xor sum in a subarray.