Xor of Subset Sums

You are given $n$ integers $A_1, A_2, \dots, A_n$. Let $N = \{1, 2, \dots, n\}$.

For a subset $I$ of $N$, define $S_I$ as follows.

$S_I = \sum_{k \in I} A_k$

That is, $S_I$ adds up $A_k$ over every index $k$ that belongs to $I$. The empty subset has sum 0, and $N$ itself counts as a subset, so there are $2^n$ values $S_I$ in total.

Let $X$ be the bitwise exclusive or of all $2^n$ values.

$X = \bigoplus_{I \subseteq N} S_I$

Compute $X$.

The first line contains $n$ ($1 \le n \le 30$).

The second line contains $n$ integers $A_1, A_2, \dots, A_n$ separated by spaces ($0 \le A_i < 2^{30}$).

Print $X$ on the first line.