#include <bits/stdc++.h>
using namespace std;
constexpr long long mod = 1000000007;
const long long INF = mod * mod;
const long double eps = 1e-9;
const long double pi = acos(-1.0);
long long mod_pow(long long a, long long n, long long m) {
  long long res = 1;
  while (n) {
    if (n & 1) res = res * a % m;
    a = a * a % m;
    n >>= 1;
  }
  return res;
}
struct modint {
  long long n;
  constexpr modint() : n(0) { ; }
  constexpr modint(const long long m) : n(m) {
    if (n >= mod)
      n %= mod;
    else if (n < 0)
      n = (n % mod + mod) % mod;
  }
  operator int() { return n; }
};
constexpr bool operator==(const modint a, const modint b) noexcept {
  return a.n == b.n;
}
constexpr modint operator+=(modint &a, const modint b) noexcept {
  a.n += b.n;
  if (a.n >= mod) a.n -= mod;
  return a;
}
constexpr modint operator-=(modint &a, const modint b) noexcept {
  a.n -= b.n;
  if (a.n < 0) a.n += mod;
  return a;
}
constexpr modint operator*=(modint &a, const modint b) noexcept {
  a.n = ((long long)a.n * b.n) % mod;
  return a;
}
constexpr modint operator+(modint a, const modint b) noexcept { return a += b; }
constexpr modint operator-(modint a, const modint b) noexcept { return a -= b; }
constexpr modint operator*(modint a, const modint b) noexcept { return a *= b; }
constexpr modint operator^(const modint a, const long long n) noexcept {
  if (n == 0) return modint(1);
  modint res = (a * a) ^ (n / 2);
  if (n % 2) res = res * a;
  return res;
}
long long inv(long long a, long long p) {
  return (a == 1 ? 1 : (1 - p * inv(p % a, a)) / a + p);
}
constexpr modint operator/(const modint a, const modint b) noexcept {
  return a * (b ^ (mod - 2));
}
const int max_n = 1 << 18;
modint fact[max_n], factinv[max_n];
void init_f() {
  fact[0] = modint(1);
  for (int i = 0; i < max_n - 1; i++) {
    fact[i + 1] = fact[i] * modint(i + 1);
  }
  factinv[max_n - 1] = modint(1) / fact[max_n - 1];
  for (int i = max_n - 2; i >= 0; i--) {
    factinv[i] = factinv[i + 1] * modint(i + 1);
  }
}
modint comb(int a, int b) {
  if (a < 0 || b < 0 || a < b) return 0;
  return fact[a] * factinv[b] * factinv[a - b];
}
using mP = pair<modint, modint>;
int dx[4] = {0, 1, 0, -1};
int dy[4] = {1, 0, -1, 0};
void solve() {
  int n;
  cin >> n;
  vector<int> a(n);
  for (int i = 0; i < n; i++) {
    cin >> a[i];
  }
  vector<int> num[25];
  for (int i = 0; i < 25; i++) {
    num[i].resize((1 << i + 1) + 1);
  }
  for (int i = 0; i < 25; i++)
    for (int j = 0; j < n; j++) {
      int k = (1 << i + 1);
      int r = a[j] % k;
      num[i][r]++;
    }
  for (int i = 0; i < 25; i++) {
    for (int j = 0; j < num[i].size() - 1; j++) {
      num[i][j + 1] += num[i][j];
    }
  }
  vector<long long> cnt(25);
  for (int i = 0; i < 25; i++)
    for (int j = 0; j < n; j++) {
      int k = (1 << i + 1);
      int r = a[j] % k;
      if (r >= k / 2) {
        cnt[i] += num[i][k - 1 - r];
        int inf = k / 2 - (r - k / 2);
        inf += k / 2;
        cnt[i] += num[i][k - 1] - num[i][inf - 1];
      } else {
        int inf = k / 2 - r;
        cnt[i] += num[i][inf + k / 2 - 1] - num[i][inf - 1];
      }
    }
  for (int i = 0; i < n; i++) {
    int x = 2 * a[i];
    for (int j = 0; j < 25; j++) {
      if ((x >> j) & 1) cnt[j]--;
    }
  }
  int ans = 0;
  for (int i = 0; i < 25; i++) {
    assert(cnt[i] % 2 == 0);
    cnt[i] /= 2;
    if (cnt[i] % 2) {
      ans += (1 << i);
    }
  }
  cout << ans << endl;
}
signed main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  solve();
  char nyaa;
  cin >> nyaa;
  return 0;
}
