#include<bits/stdc++.h>
#define ll long long
#define pii pair<int,int>
#define pll pair<ll,ll>
#define plx pair<ll,int>
#define f first
#define s second
#define pb push_back
#define all(x) x.begin(),x.end()
#define vi vector<int>
#define vvi vector<vi>
#define pp pair<ll,int>
#define ub(x,i) upper_bound(all(x),i)-x.begin()
#define lb(x,i) lower_bound(all(x),i)-x.begin()
#define t3 tuple<int,int,int>
using namespace std;
const int mxn=5e5+5;
const ll x[31]={1,2,4,8,16,32,64,128,256,512,1024,2048,4096,8192,16384,32768,65536,131072,262144,524288,1048576,2097152,4194304,8388608,16777216,33554432,67108864,134217728,268435456,536870912,1073741824};
int main(){
ios_base::sync_with_stdio(0);cin.tie(0);
int n;cin>>n;
ll v[n];ll rs=0;
for(int i=0;i<n;i++)cin>>v[i];
for(int p=30;p>=1;p--){
vector<ll>md;
for(int i=0;i<n;i++)v[i]%=x[p],md.pb(v[i]);
sort(all(md));ll cnt=0;
ll l=x[p]/2,r=x[p]-1;
for(int i=0;i<n;i++){
ll vx=(v[i]%x[p]+x[p])%x[p];
ll tl=((l-vx)%x[p]+x[p])%x[p],tr=((r-vx)%x[p]+x[p])%x[p];
if(tl<=tr)cnt+=upper_bound(all(md),tr)-lower_bound(all(md),tl);
else {
cnt+=upper_bound(all(md),2e12)-lower_bound(all(md),tl);
cnt+=upper_bound(all(md),tr)-lower_bound(all(md),0);
}
}if(cnt%2==1)rs+=x[p-1];
}cout<<rs;
}
