#include <bits/stdc++.h>
using namespace std;
const long long mod = (long long)1e9 + 7;
const long long inf = (long long)1e16;
const long double eps = 1e-12;
const long long N = (int)1e5 + 5;
const long long LOGN = 19;
const long double PI = 3.14159265358979323846;
inline long long mul(long long a, long long b, long long m = mod) {
  return (long long)(a * b) % m;
}
inline long long add(long long a, long long b, long long m = mod) {
  a += b;
  if (a >= m) a -= m;
  if (a < 0) a += m;
  return a;
}
inline long long power(long long a, long long b, long long m = mod) {
  if (b == 0) return 1;
  if (b == 1) return (a % m);
  long long x = power(a, b / 2, m);
  x = mul(x, x, m);
  if (b % 2) x = mul(x, a, m);
  return x;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  if (0) {
    freopen("C:\\Users\\Dishant\\Desktop\\Collection-DEV c++\\input.txt", "r",
            stdin);
    freopen("C:\\Users\\Dishant\\Desktop\\Collection-DEV c++\\output.txt", "w",
            stdout);
  }
  int n;
  cin >> n;
  map<long long, long long> even_mp, odd_mp;
  long long a[n];
  for (int i = 0; i < n; i++) cin >> a[i];
  long long curr = 0, ans = 0;
  for (int i = 0; i < n; i++) {
    curr ^= a[i];
    if (i & 1) {
      ans += odd_mp[curr];
      odd_mp[curr]++;
    } else {
      ans += even_mp[curr];
      even_mp[curr]++;
    }
    if (curr == 0) {
      if (i & 1) ans++;
    }
  }
  cout << ans;
  return 0;
}
