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 = '# seishin.py\nN = int(input())\n*A, = map(int, input().split())\n*B, = map(int, input().split())\n\nM = 32\nMOD = [(2 << i) for i in range(M+1)]\n\nfrom bisect import bisect\ndef make(B, mode):\n    S = [None]*M\n    s = {}; get = s.get\n    for b in B:\n        s[b] = get(b, 0) ^ 1\n    S[M-1] = sorted(b for b in s if s[b])\n\n    for i in range(M-2, -1, -1):\n        t = S[i+1]; l = len(t)\n        m = MOD[i]\n        mid = q = bisect(t, m-1)\n        p = 0\n        if q < l:\n            if p < mid:\n                def gen(p, q):\n                    u = t[p]; v = t[q]\n                    while p < mid and q < l:\n                        if u+m == v:\n                            p += 1; u = t[p] if p < mid else None\n                            q += 1; v = t[q] if q < l else None\n                        elif u+m < v:\n                            yield u\n                            p += 1; u = t[p] if p < mid else None\n                        else:\n                            yield v-m\n                            q += 1; v = t[q] if q < l else None\n                    while p < mid:\n                        yield t[p]; p += 1\n                    while q < l:\n                        yield t[q]-m; q += 1\n                *S[i], = gen(p, q)\n            else:\n                *S[i], = (u-m for u in t)\n        else:\n            *S[i], = t\n    if mode:\n        for i in range(M):\n            m = MOD[i]\n            S[i] += list(map(lambda x: x+m, S[i]))\n    return S\nS = make(A, 0)\nT = make(B, 1)\n\nans = 0\nif 0 in S[0]:\n    ans ^= 1 in T[0]\nif 1 in S[0]:\n    ans ^= 0 in T[0]\n\nfor i in range(1, M):\n    s = S[i]; ls = len(S)\n    t = T[i]; lt = len(t)\n    m = MOD[i]; p = MOD[i-1]\n    P = p+m; Q = 2*m\n\n    if lt:\n        c = 0\n        f = lt\n        while P <= t[f-1]:\n            f -= 1\n\n        u = f; v = lt\n        for a in s:\n            while u > 0 and P <= a + t[u-1]:\n                u -= 1\n            while v > 0 and Q <= a + t[v-1]:\n                v -= 1\n            c += (v - u)\n        if c & 1:\n            ans ^= 1 << i\nprint(ans)'
_co = compile(_CODE, USER_FILENAME, "exec")
exec(_co, ns, ns)

```

Measured memory_bytes: 20019