To xor or not to xor

Submit solution
Points: 100 (partial)
Time limit: 0.5s
Memory limit: 64M
Author:
cse
Problem type

time limit per test: 0.5 sec. memory limit per test: 65536 KB

The sequence of non-negative integers A1, A2, ..., AN is given. You are to find some subsequence Ai1, Ai2, ..., Aik (1 <= i1 < i2 < ... < ik <= N) such, that Ai1 XOR Ai2 XOR ... XOR Aik has a maximum value.

Input

The first line of the input file contains the integer number N (1 <= N <= 100). The second line contains the sequence A1, A2, ..., AN (0 <= Ai <= 10^18).

Output

Write to the output file a single integer number -- the maximum possible value of Ai1 XOR Ai2 XOR ... XOR Aik.

Sample test(s)

Input

3 
11 9 5

Output

14

Comments


  • 0
    jojo  commented on March 9, 2024, 11:06 a.m.

    Is there any particular reason to remove judge for this problem?