Score : 1000 points
There is a sequence of length N: a = (a_1, a_2, ..., a_N). Here, each a_i is a non-negative integer.
Snuke can repeatedly perform the following operation:
Snuke's objective is to match a with another sequence b = (b_1, b_2, ..., b_N). Here, each b_i is a non-negative integer.
Determine whether the objective is achievable, and find the minimum necessary number of operations if the answer is positive.
Input is given from Standard Input in the following format:
N a_1 a_2 ... a_N b_1 b_2 ... b_N
If the objective is achievable, print the minimum necessary number of operations.
Otherwise, print -1
instead.
3 0 1 2 3 1 0
2
At first, the XOR of all the elements of a is 3. If we replace a_1 with 3, a becomes (3, 1, 2).
Now, the XOR of all the elements of a is 0. If we replace a_3 with 0, a becomes (3, 1, 0), which matches b.
3 0 1 2 0 1 2
0
2 1 1 0 0
-1
4 0 1 2 3 1 0 3 2
5