People in the Tomskaya region like magic formulas very much. You can see some of them below.

Imagine you are given a sequence of positive integer numbers *p*<sub class="lower-index">1</sub>, *p*<sub class="lower-index">2</sub>, ..., *p*<sub class="lower-index">*n*</sub>. Lets write down some magic formulas:

Here, "mod" means the operation of taking the residue after dividing.

The expression <img align="middle" class="tex-formula" src="https://espresso.codeforces.com/b364f2e04c665b78b924ec10666327a4ef4635bc.png" style="max-width: 100.0%;max-height: 100.0%;"/> means applying the bitwise *xor* (excluding "OR") operation to integers *x* and *y*. The given operation exists in all modern programming languages. For example, in languages C++ and Java it is represented by "^", in Pascal — by "xor".

People in the Tomskaya region like magic formulas very much, but they don't like to calculate them! Therefore you are given the sequence *p*, calculate the value of *Q*.
The first line of the input contains the only integer *n* (1 ≤ *n* ≤ 10<sup class="upper-index">6</sup>). The next line contains *n* integers: *p*<sub class="lower-index">1</sub>, *p*<sub class="lower-index">2</sub>, ..., *p*<sub class="lower-index">*n*</sub> (0 ≤ *p*<sub class="lower-index">*i*</sub> ≤ 2·10<sup class="upper-index">9</sup>).
import sys


def solve(n, p):
    tab = [0 for _ in range(n)]
    for i in range(1, n):
        tab[i] = tab[i - 1] ^ i

    columns = []
    for i in range(1, n + 1):
        cycles = n // i
        rem = n % i

        if cycles % 2 == 0:
            columns.append(tab[rem])
        else:
            columns.append(tab[i - 1] ^ tab[rem])

    for i in range(1, len(columns)):
        columns[i] = columns[i - 1] ^ columns[i]
    for i in range(1, len(p)):
        p[i] = p[i - 1] ^ p[i]

    return p[-1] ^ columns[-1]


def readinput():
    n = int(sys.stdin.readline().rstrip())
    p = list(map(int, sys.stdin.readline().rstrip().split(" ")))
    print(solve(n, p))


readinput()
