#include <bits/stdc++.h>
using namespace std;
long long t, n, m, nn, mm, ma, mb, h, r, l, i, j, ii, jj, x[1000001],
    y[1000001], z, g, aa, bb, a, b, c, d, k, q, mod = 1e9 + 7;
vector<pair<long long, long long> > v[1000001];
vector<long long> vvv, vv;
queue<pair<long long, long long> > qq;
pair<long long, long long> p[1000001];
map<long long, long long> mp, mpp, mppp;
set<long long> se;
set<long long>::iterator it, itt;
string s, s1, s2;
char cc;
int main() {
  ios::sync_with_stdio(0);
  cin >> n;
  for (i = 1; i <= n; i++) {
    cin >> a;
    while (a > 0) {
      x[i] += a % 2;
      a /= 2;
    }
    y[i] = x[i];
    x[i] += x[i - 1];
    if (i > 60) mp[x[i] % 2]++;
  }
  for (i = 1, j = 61; j <= n; i++, j++) {
    z += mp[b % 2];
    mp[x[j] % 2]--;
    if (y[i] % 2 == 1) b++;
  }
  for (i = n; i > 1; i--) x[i] -= x[i - 1];
  for (j = 1; j <= n; j++) {
    m = 0;
    a = 0;
    for (i = j; i < j + 60 && i <= n; i++) {
      a += x[i];
      m = max(m, x[i]);
      if (i > j && a >= m * 2 && a % 2 == 0) z++;
    }
  }
  cout << z;
  return 0;
}
