Score : $300$ points

Problem Statement

Snuke has $N$ hats. The $i$-th hat has an integer $a_i$ written on it.

There are $N$ camels standing in a circle. Snuke will put one of his hats on each of these camels.

If there exists a way to distribute the hats to the camels such that the following condition is satisfied for every camel, print Yes; otherwise, print No.

• The bitwise XOR of the numbers written on the hats on both adjacent camels is equal to the number on the hat on itself.

Constraints

• All values in input are integers.
• $3 \leq N \leq 10^{5}$
• $0 \leq a_i \leq 10^{9}$

Input

Input is given from Standard Input in the following format:

$N$

$a_1$ $a_2$ $\ldots$ $a_{N}$

Output

Print the answer.

3
1 2 3

Yes

• If we put the hats with $1$, $2$, and $3$ in this order, clockwise, the condition will be satisfied for every camel, so the answer is Yes.

4
1 2 4 8

No

• There is no such way to distribute the hats; the answer is No.