#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define sz size()
#define ff first
#define ss second
#define pb push_back
#define pii pair <int, int>
#define dur exit(0)
#define dur1 return(0)
const int N = 1e6 + 5;
const int BIT = 31;
int n, a[N];
map <int, int> val, val1;
int main () {
// freopen ("input.txt", "r", stdin);
ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
cin >> n;
for (int i = 1; i <= n; ++i) {
cin >> a[i];
}
int jogap = 0;
for (int bit = BIT - 1; bit >= 0; bit--) {
// jogabyn bit-njy bit-y 1-my yada 0-my
// ony sanamaly
// if (bit > 4) continue;
ll sana = 0, sana1 = 0, kop = 0, kop1 = 0, ayyr = 0;
for (int i = 1; i <= n; ++i) {
if (a[i]>>bit&1) {
int san = 0, san1 = 0;
kop++;
san |= (1<<bit);
for (int j = bit - 1; j >= 0; j--) {
san <<= 1; san1 <<= 1;
san |= 1; san1 |= 1;
if (a[i]>>j&1) {
sana += val[san];
ayyr += val1[san1];
san ^= 1; san1 ^= 1;
}
}
if (bit and (a[i] >> (bit - 1) & 1)) {
sana++;
}
san = 0;
san |= (1 << bit);
for (int j = bit - 1; j >= 0; j--) {
san <<= 1;
if (a[i]>>j&1) {
san |= 1;
val[san]++;
}
}
}
else {
int san = 0, san1 = 0;
kop1++;
san1 |= (1 << bit);
for (int j = bit - 1; j >= 0; j--) {
san <<= 1; san1 <<= 1;
san |= 1; san1 |= 1;
if (a[i]>>j&1) {
sana1 += val1[san];
ayyr += val[san1];
san ^= 1; san1 ^= 1;
}
}
if (bit and (a[i] >> (bit - 1) & 1)) {
sana1++;
}
san = 0;
for (int j = bit - 1; j >= 0; j--) {
san <<= 1;
if (a[i]>>j&1) {
san |= 1;
val1[san]++;
}
}
}
// ozunem barmaly variant bar
}
val.clear();
val1.clear();
ll sum = sana + sana1 + (kop * kop1) - ayyr;
if (sum % 2) {
jogap |= (1 << bit);
}
// if (sum > 0) {
// cout << bit << " " << " " << sum << "\n";
// cout << sana << " " << sana1 << " " << kop << " " << kop1 << " " << ayyr << "\n";
// }
}
cout << jogap << "\n";
}
/*
1 1 7
ans = 12
output = 14
*/
