Problem Statement

There are $N$ Snuke Cats numbered $1,2,\dots ,N$, where $N$ is even.

Each Snuke Cat wears a red scarf, on which his favorite non-negative integer is written.

Recently, they learned the operation called xor (exclusive OR).

They wanted to use this operation quickly, so each of them calculated the xor of the integers written on their scarfs except his scarf.

We know that the xor calculated by Snuke Cat $i$, that is, the xor of the integers written on the scarfs except the scarf of Snuke Cat $i$ is $a_i$. Using this information, restore the integer written on the scarf of each Snuke Cat.

Constraints

• All values in input are integers.
• $2\le N\le 200000$
• $N$ is even.
• $0\le a_i\le {10}^9$
• There exists a combination of integers on the scarfs that is consistent with the given information.

Sample Input 1 Copy

4
20 11 9 24

Sample Output 1 Copy

26 5 7 22

• $5\text{xor}7\text{xor}22=20$
• $26\text{xor}7\text{xor}22=11$
• $26\text{xor}5\text{xor}22=9$
• $26\text{xor}5\text{xor}7=24$