#include <bits/stdc++.h>
using namespace std;
void fun() {}
long long int md = 998244353;
long long int __gcd(long long int a, long long int b) {
  if (b == 0) return a;
  return __gcd(b, a % b);
}
long long int poww(long long int a, long long int b, long long int md) {
  if (b < 0) return 0;
  if (a == 0) return 0;
  long long int res = 1;
  while (b) {
    if (b & 1) {
      res = (1ll * res * a) % md;
    }
    a = (1ll * a * a) % md;
    b >>= 1;
  }
  return res;
}
long long int poww(long long int a, long long int b) {
  if (b < 0) return 0;
  if (a == 0) return 0;
  long long int res = 1;
  while (b) {
    if (b & 1) {
      res = (1ll * res * a);
    }
    a = (1ll * a * a);
    b >>= 1;
  }
  return res;
}
void ainp(long long int arr[], long long int n) {
  for (long long int i = 1; i <= n; i++) cin >> arr[i];
}
void disp(long long int arr[], long long int n) {
  for (long long int i = 1; i <= n; i++) cout << arr[i] << " ";
  cout << "\n";
}
void dispv(vector<long long int> &v) {
  for (long long int i = 0; i < v.size(); i++) cout << v[i] << " ";
  cout << "\n";
}
long long int divide(long long int a, long long int b, long long int md) {
  long long int rr = a * (poww(b, md - 2, md));
  rr %= md;
  return rr;
}
const long long int size = 400005;
long long int arr[size], brr[size];
long long int n, ans;
signed main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  fun();
  cin >> n;
  for (long long int i = 1; i <= n; i++) {
    cin >> arr[i];
    ans = ans ^ arr[i];
  }
  if (n & 1) ans = 0;
  for (long long int bit = 1; bit <= 24; bit++) {
    for (long long int i = 1; i <= n; i++) brr[i] = arr[i] & ((1 << bit) - 1);
    sort(brr + 1, brr + 1 + n);
    long long int ind = n;
    long long int wanted = 1 << bit;
    for (long long int i = 1; i <= n; i++) {
      while (ind && brr[ind] + brr[i] >= wanted) ind--;
      long long int num = max(0ll, i - ind - 1);
      if (num & 1) ans = ans ^ (1 << bit);
    }
  }
  cout << ans << "\n";
  return 0;
}
