#227 Yet Another XOR Problem

Statement

Statement language

You are given two integer arrays $A$ and $B$ of length $N$ .

You may perform the following operation on array $A$ any number of times.

Choose an integer $i$ such that $2 \leq i \leq N-1$ . Then replace $A_i$ with , where denotes bitwise XOR.

Determine whether array $A$ can be made equal to array $B$ .

The input is given in the following format.

$T$ $N$ $A_1\ A_2\ \cdots\ A_N$

For each test case, print YES if array $A$ can be made equal to array $B$ , and print NO otherwise.

#	Score	Constraints
1	12	$N=3$ .
2	23	The sum of $N$ over all test cases does not exceed $2\ 000$ .
3	65	There are no additional constraints.

Input

Output

YES
YES
NO
NO

In the first test case, choosing $i=2$ once changes the array to $[1,0,3]$ .

In the second test case, choosing $i=2$ once changes the array to .