Problem Background

This is a template problem.

Problem Description

Given \( n \) integers (numbers may be repeated), find the maximum XOR sum that can be obtained by selecting any number of these integers.

Input Format

The first line contains a single number \( n \), representing the number of elements.

The next line contains \( n \) numbers.

Output Format

Output a single line, representing the answer.

Sample Input and Output

Sample Input #1

2
1 1

Sample Output #1

1

Sample Input #2

4
1 5 9 4

Sample Output #2

13

Notes

\( 1 \leq n \leq 50, 0 \leq S_i < 2^{50} \)

见题面 Input 部分

见题面 Output 部分