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>).
from sys import stdin ,stdout
input=stdin.readline
inp=lambda : map(int,input().split())
def print(*args, end='\n', sep=' ') -> None:
    stdout.write(sep.join(map(str, args)) + end)

def XOR(n) :
    if n%4== 0 : return n 
    elif n%4==1 : return 1 
    elif n%4==2 : return n+1 
    return 0 

n= int(input()) ; arr=list(inp()) ; xor =0 ; mid=n//2 
for i in range(1,mid+1) : 
    if (n//i)&1 :  xor ^=XOR(i-1)
    xor^=XOR(n%i) 
if n&1 : l =r =n//2
else : l=n//2 ; r= n//2-1 

for i in range(mid+1 , n+1) :
    xor^=XOR(l) ;  xor^=XOR(r)
    l+=1 ; r-=1 

for i in range(n) : xor^=arr[i]
print(xor)
