← 返回题目

题库练习 Little Xor

← 上一题下一题 →

A8835 | $Little Xor$

时间限制1s

内存限制256MB

通过 / 提交0/0

题目描述

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.

输入输出样例

输入 #1

5
1 2 1 1 2

输出 #1

输入 #2

3
1 2 7

输出 #2

输入 #3

4
4 2 4 8

输出 #3

C++ 编辑器

输入

输出