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 = 'from bisect import bisect_left\n\nn = int(input())\na = list(map(int, input().split()))\nb = list(map(int, input().split()))\n\nm = 30\nd = []\n# d[i] = 1<<i\nfor i in range(m+1):\n    d.append(1<<i)\n\nc = [[] for i in range(m)]\nfor bi in b:\n    for i in range(m):\n        c[i].append(bi&(d[i+1]-1))\nfor i in range(m):\n    c[i].sort()\n\nketa = [0]*m\n\n# しゃくとりするなら桁ごとにやるしか無い\nfor i in range(m):\n    aa = [ai&(d[i+1]-1) for ai in a]\n    aa.sort()\n    a0 = aa[0]\n\n    i1 = d[i]\n    i2 = d[i+1]\n    i3 = i2+i1\n    b1 = bisect_left(c[i], i1-a0)\n    b2 = bisect_left(c[i], i2-a0)\n    b3 = bisect_left(c[i], i3-a0)\n\n    for ai in aa:\n        # 尺取\n        # aiは大きくなる→境界は小さくなる\n        # 引いたあとのindexが0以上であることも必要\n        while b1-1 >= 0 and c[i][b1-1] >= i1-ai:\n            b1 -= 1\n        while b2-1 >= 0 and c[i][b2-1] >= i2-ai:\n            b2 -= 1\n        while b3-1 >= 0 and c[i][b3-1] >= i3-ai:\n            b3 -= 1\n        keta[i] += b2-b1 + n-b3\n    keta[i] %= 2\n\n#print(keta)\n\nans = 0\nfor i in range(m):\n    ans += keta[i]*(1<<i)\n\nprint(ans)'
_co = compile(_CODE, USER_FILENAME, "exec")
exec(_co, ns, ns)

```

Measured memory_bytes: 14215