CF424C.Magic Formulas

普及/提高-

通过率：0%

AC君温馨提醒

该题目为【codeforces】题库的题目，您提交的代码将被提交至codeforces进行远程评测，并由ACGO抓取测评结果后进行展示。由于远程测评的测评机由其他平台提供，我们无法保证该服务的稳定性，若提交后无反应，请等待一段时间后再进行重试。

题目描述

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_{1}$ , $p_{2}$ , ..., $p_{n}$ . Lets write down some magic formulas:

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

The expression 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^{6}$ ). The next line contains $n$ integers: $p_{1},p_{2},...,p_{n}$ ( $0<=p_{i}<=2·10^{9}$ ).

输出格式

The only line of output should contain a single integer — the value of $Q$ .

输入输出样例

输入#1
```
3
1 2 3
```
输出#1
```
3
```

首页