#描述#
Given is a sequence of integer numbers.
You are to find a consecutive sub-sequence, which the xor value between all these numbers has the maximum value.

#格式#
##输入格式##
There are multiple cases. For each case:
Line 1: A single integer N(1&ltN&lt=100000)
Followed N integers ranging from 0 to 1000,000.

##输出格式##
For each case output the maximum xor value in a single line.

#样例1#
##样例输入1##

4
2 2 4 4
5
3 1 2 4 5

##样例输出1##

6
7

#限制#
1000ms
32768KB

#提示#
6=2^4 ;
7=1^2^4 ;

#来源#
MoonLight