Present

Present

Catherine received an array of integers as a gift for March 8. Eventually she grew bored with it, and she started calculated various useless characteristics for it. She succeeded to do it for each one she came up with. But when she came up with another one — xor of all pairwise sums of elements in the array, she realized that she couldn’t compute it for a very large array, thus she asked for your help. Can you do it? Formally, you need to compute

         $(a_1+a_2)\oplus (a_1+a_3)\oplus ...\oplus (a_1+a_n)\oplus (a_2+a_3)\oplus ..(a_2+a_n)\oplus ...\oplus (a_{n-1}\oplus a_n)$

Here x⊕y is a bitwise XOR operation (i.e. x ^ y in many modern programming languages).

Input

The first line contains a single integer $n(2\le n\le 400000)$ — the number of integers in the array.

The second line contains integers $a_1,a_2,\dots ,a_n(1\le ai\le 10^7)$.

Output

Print a single integer — xor of all pairwise sums of integers in the given array.

Examples
Input
'2
1 2
Output
3
Input
3
1 2 3
Output
2

Note

In the first sample case there is only one sum 1+2=3.

In the second sample case there are three sums: 1+2=3, 1+3=4, 2+3=5. In binary they are represented as $011_2\oplus 100_2\oplus 101_2=010_2$, thus the answer is 2.

思路

题意：给出一个数组，然后按照给出的式子进行异或操作，求出结果。
分析：对于结果的二进制每一位进行判断，如果k位为1，说明有奇数对$(a_i+a_j)$的和k位为1.所以我们就考虑有多少对奇数和的k位为1，即可得出答案。

1. 首先高于k位的二进制求和对于k位没有影响，所以我们先对$a_i$取$2^{k+1}$的模，得到$a_i$的范围为$[0,2^{k+1}-1]$.
2. 所以可以得到和的范围为$[0,2^{k+2}-2]$,如果k位为1，那么该值范围为$[2^k,2^{k+1}-1]$或$[2^k+2^{k+1},2^{k+2}-2]$.
3. 所以我们从每一位开始，对于$a_i$进行枚举，二分判断有多少满足的$a_j$即可

代码如下：

#include<cstdio>
#include<algorithm>
#include<cstring>
#include<vector>
#include<queue>
#define INF 0x3f3f3f3f
typedef long long ll;
using namespace std;
const int mx=4e5+10;

//2^(k+1)-1       2^(k+2)-2
//[2^i,2^(i+1)-1],[2^(i+1)+2^i,2^(i+2)-2]

int a[mx],b[mx];
int n,ans;

int main()
{
	scanf("%d",&n);
	for(int i=0;i<n;i++)
	scanf("%d",&a[i]);
	
	ans=0;
	for(int k=0;k<26;k++)
	{
		for(int i=0;i<n;i++)
		b[i]=a[i]%(1<<(k+1));//取模
		sort(b,b+n);//排序二分得到答案
		for(int i=0;i<n;i++)
		{
			int L=max(0,(1<<k)-b[i]);//注意max
			int R=(1<<(k+1))-1-b[i];
			int cnt=upper_bound(b,b+i,R)-lower_bound(b,b+i,L);//两个二分得到结果
			if(cnt&1) ans^=1<<k;
			
			L=max(0,(1<<(k+1))+(1<<k)-b[i]);
			R=(1<<(k+2))-1-b[i];
			cnt=upper_bound(b,b+i,R)-lower_bound(b,b+i,L);
			if(cnt&1) ans^=1<<k;
		}
	}
	printf("%d\n",ans);
	return 0;
}