Little Xor

### 题目大意： 给出一个正整数序列，求异或和最大的连续子段和。 ### 输入： 第一行一个数n，($1\leq n\leq 100$ );第二行n个整数，所有数最大不超过$2^{30}$ 。 ### 输出： 一个数，即最大的异或和。

Little Petya likes arrays that consist of non-negative integers a lot. Recently his mom has presented him one such array consisting of $ n $ elements. Petya immediately decided to find there a segment of consecutive elements, such that the $ xor $ of all numbers from this segment was maximal possible. Help him with that. The $ xor $ operation is the bitwise exclusive "OR", that is denoted as "xor" in Pascal and "^" in C/C++/Java.

The first line contains integer $ n $ ( $ 1<=n<=100 $ ) — the number of elements in the array. The second line contains the space-separated integers from the array. All numbers are non-negative integers strictly less than $ 2^{30} $ .

Print a single integer — the required maximal $ xor $ of a segment of consecutive elements.

5
1 2 1 1 2

3

3
1 2 7

7

4
4 2 4 8

14

In the first sample one of the optimal segments is the segment that consists of the first and the second array elements, if we consider the array elements indexed starting from one. The second sample contains only one optimal segment, which contains exactly one array element (element with index three).