You are given two integer sequences, each of length N: a_1, ..., a_N and b_1, ..., b_N.
There are N^2 ways to choose two integers i and j such that 1 \leq i, j \leq N. For each of these N^2 pairs, we will compute a_i + b_j and write it on a sheet of paper.
That is, we will write N^2 integers in total.
Compute the XOR of these N^2 integers.
Definition of XOR
The XOR of integers c_1, c_2, ..., c_m is defined as follows:
 - Let the XOR be X. In the binary representation of X, the digit in the 2^k's place (0 \leq k; k is an integer) is 1 if there are an odd number of integers among c_1, c_2, ...c_m whose binary representation has 1 in the 2^k's place, and 0 if that number is even.
For example, let us compute the XOR of 3 and 5. The binary representation of 3 is 011, and the binary representation of 5 is 101, thus the XOR has the binary representation 110, that is, the XOR is 6.

-----Constraints-----
 - All input values are integers.
 - 1 \leq N \leq 200,000
 - 0 \leq a_i, b_i < 2^{28}

-----Input-----
Input is given from Standard Input in the following format:
N
a_1 a_2 ... a_N
b_1 b_2 ... b_N

-----Output-----
Print the result of the computation.

-----Sample Input-----
2
1 2
3 4

-----Sample Output-----
2

On the sheet, the following four integers will be written: 4(1+3), 5(1+4), 5(2+3) and 6(2+4).

```python

USER_FILENAME = "<user_code>"
import sys, json, builtins
import math, heapq, bisect, itertools, functools, collections, statistics, fractions, decimal, operator, array, random, re, string, os, pathlib
try:
    import resource as _res
except Exception:
    _res = None
from collections import Counter, defaultdict, deque, OrderedDict
from functools import lru_cache, reduce
from itertools import accumulate, permutations, combinations, product
from math import gcd, ceil, floor, sqrt
from decimal import Decimal
try:
    from typing import *
except Exception:
    pass
try:
    sys.setrecursionlimit(1_000_000)
except Exception:
    pass
try:
    import site as _site
    try:
        _sys_sites = _site.getsitepackages() if hasattr(_site, "getsitepackages") else []
        for _p in _sys_sites:
            if _p and _p not in sys.path:
                sys.path.append(_p)
    except Exception:
        pass
    try:
        _usp = _site.getusersitepackages()
        if isinstance(_usp, str):
            _usp = [_usp]
        for _p in _usp:
            if _p and _p not in sys.path:
                sys.path.append(_p)
    except Exception:
        pass
except Exception:
    pass

ns = {"__name__": "__main__"}
for _k, _v in list(globals().items()):
    if not _k.startswith("_"):
        ns[_k] = _v
_CODE = 'N, = list(map(int, input().split()))\nP = list(map(int, input().split()))\nQ = list(map(int, input().split()))\nmxk = 29\nmsk = (1<<mxk) - 1\nmsk2 = (1<<(mxk-1))\nr = 0\nfor i in range(mxk):\n    # 下からiビット目をみる\n    for j in range(N):\n        Q[j] = Q[j] & msk\n        P[j] = P[j] & msk\n    msk >>= 1\n    P.sort()\n    Q.sort()\n    j1 = N-1\n    j2 = N-1\n    b = 0\n    ss = N\n#    print(P, Q)\n    for l in range(N):\n        if P[l] & msk2:\n            ss = l\n            break\n        k1 = msk2 - (P[l]&msk)\n        k2 = k1 + msk2\n        while j1 >= 0:\n            if Q[j1] < k1:\n                break\n            j1 -= 1\n        while j2 >= 0:\n            if Q[j2] < k2:\n                break\n            j2 -= 1\n        b += j2 - j1\n#        print("a",j2-j1,k1,k2,j1,j2)\n\n    j1 = N-1\n    j2 = N-1\n#    print(ss)\n    for l in range(ss, N):\n        k1 = msk2 - (P[l]&msk)\n        k2 = k1 + msk2\n        while j1 >= 0:\n            if Q[j1] < k1:\n                break\n            j1 -= 1\n        while j2 >= 0:\n            if Q[j2] < k2:\n                break\n            j2 -= 1\n#        print("b",j1 - j2 + N)\n        b += j1 + N - j2\n\n#    b = 0\n#    for p in P:\n#        if p & msk2:\n#            x = g(2*msk2 - (p&msk))\n#            z = g(msk2 - (p&msk))\n#            b += z+N-x\n#        else:\n#            x = g(2*msk2 - (p&msk))\n#            z = g(msk2 - (p&msk))\n#            b += x-z\n#    print(b, r, i)\n    if b%2:\n        r += 1<<(mxk-1-i)\n    msk2 >>= 1\nprint(r)\n'
_co = compile(_CODE, USER_FILENAME, "exec")
exec(_co, ns, ns)

```

Measured memory_bytes: 13823