#include <bits/stdc++.h>
#define int long long
using namespace std;
const int N = 1e6 + 11;
int a[N], b0[N], b0n, b1[N], b1n;
int32_t main(){
int n; cin >> n;
for(int i = 0; i < n; i++){
cin >> a[i];
}
int ans = 0;
for(int s = 0; s <= 29; s++){
int c = 0;
b0n = b1n = 0;
for(int j = 0; j < n; j++){
if(a[j] & (1 << s)) b1[b1n++] = a[j] % (1 << s);
else b0[b0n++] = a[j] % (1 << s);
}
sort(b0, b0 + b0n); sort(b1, b1 + b1n);
int r = b0n;
for(int l = 0; l < b0n; l++){
r = max(r, l + 1);
while(r - 1 > l && b0[l] + b0[r - 1] >= (1 << s)) r--;
c += b0n - r;
}
r = b1n;
for(int l = 0; l < b1n; l++){
r = max(r, l + 1);
while(r - 1 > l && b1[l] + b1[r - 1] >= (1 << s)) r--;
c += b1n - r;
}
r = b1n;
for(int l = 0; l < b0n; l++){
while(r > 0 && b0[l] + b1[r - 1] >= (1 << s)) r--;
c += b1n - r;
}
c += b0n * b1n;
ans ^= (1 << s) * (c % 2);
}
for(int i = 0; i < n; i++){
ans ^= (a[i] * 2);
}
cout << ans << endl;
}
