The Lost Array

JJ had an array $A$ of length $N$ such that $0 \le A_i \lt 2^{30}$ for all $1 \le i \le N$. He listed down the [XOR](https://en.wikipedia.org/wiki/Bitwise_operation#XOR) of all the [subsequences](https://en.wikipedia.org/wiki/Subsequence) of $A$ of size $\ge (N - 1)$ in some **random** order. Let's call the XOR of these $(N + 1)$ subsequences as $B_1, B_2, \ldots, B_{N+1}$. Unfortunately, he lo