Two Sequences (二分+二进制) （好题）

You are given two integer sequences, each of length N: a1,…,aN and b1,…,bN.

There are N2 ways to choose two integers i and j such that 1≤i,j≤N. For each of these N2 pairs, we will compute ai+bj and write it on a sheet of paper. That is, we will write N2 integers in total.

Compute the XOR of these N2 integers.

 

Definition of XOR

 

Constraints

 

• All input values are integers.
• 1≤N≤200,000
• 0≤ai,bi<228

Input

 

Input is given from Standard Input in the following format:

N
a1 a2 … aN
b1 b2 … bN

Output

 

Print the result of the computation.

Sample Input 1