#include <bits/stdc++.h>
using namespace std;
long long mod = 1e9 + 7;
long long Bpow(long long a, long long s) {
  if (s == 0) {
    return 1;
  }
  long long u = Bpow(a, s / 2);
  if (s & 1)
    return u * u % mod * a % mod;
  else
    return u * u % mod;
}
int32_t main() {
  long long n;
  cin >> n;
  vector<long long> a(n);
  for (long long i = 0; i < n; i++) {
    cin >> a[i];
  }
  long long ans = 0;
  for (long long i = 0; i < n - 2; i++) {
    long long now = a[i + 1];
    for (long long j = i + 2; j < n; j++) {
      if (now > a[i] * 2) break;
      if ((a[i] ^ a[j]) == now && a[i] > a[j]) ++ans;
      now += a[j];
    }
  }
  for (long long i = n - 1; i > 1; i--) {
    long long now = a[i - 1];
    for (long long j = i - 2; j >= 0; j--) {
      if (now > a[i] * 2) break;
      if ((a[i] ^ a[j]) == now && a[i] > a[j]) ++ans;
      now += a[j];
    }
  }
  cout << ans;
}
