Final Element

You are given an array $A$ of $N$ non-negative integers. Define a process as follows: - Create a new array $B$ of length $N - 1$ such that $B_i = A_i \oplus A_{i + 1}$, where $\oplus$ represents the Bitwise XOR operator. - Replace $A$ with $B$. If we perform the process $N - 1$ times iteratively, we are left with an array of length $1$. Find the last element. ### Input - The first line of inpu