XOR Sum 2

You are given a sequence $A$ of $N$ numbers.

You want to choose a subsequence of $A$. The XOR sum of a subsequence is the value obtained by XORing all of its elements together.

Given the sequence $A$, write a program that finds the subsequence with the largest XOR sum.

The first line contains the length of the sequence $N$ ($1 \le N \le 100{,}000$). The second line contains the $N$ numbers of the sequence $A$. Each number in $A$ is a positive integer less than or equal to $10^{18}$.

Print the XOR sum of the subsequence of $A$ whose XOR sum is the largest.