Code Submission Evaluation System Login

CSES Problem Set

Maximum Xor Subarray


Task | Statistics


CSES - Maximum Xor SubarrayCSES - Maximum Xor Subarray

Time limit:1.00 s Memory limit:512 MB

Given an array of $n$ integers, your task is to find the maximum xor sum in a subarray.

Input

The first input 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.

Output

Print one integer: the maximum xor sum in a subarray.

Constraints
Example

Input:
4
5 1 5 9


Output:
13