#include <bits/stdc++.h>
using namespace std;
const int inf = 1e9;
const long long Inf = 1e18;
const int N = 3e5 + 10;
const int mod = 0;
long long gi() {
  long long x = 0, o = 1;
  char ch = getchar();
  while ((ch < '0' || ch > '9') && ch != '-') ch = getchar();
  if (ch == '-') o = -1, ch = getchar();
  while (ch >= '0' && ch <= '9') x = x * 10 + ch - '0', ch = getchar();
  return x * o;
}
template <typename T>
bool chkmax(T &a, T b) {
  return a < b ? a = b, 1 : 0;
};
template <typename T>
bool chkmin(T &a, T b) {
  return a > b ? a = b, 1 : 0;
};
int add(int a, int b) { return a + b >= mod ? a + b - mod : a + b; }
int sub(int a, int b) { return a - b < 0 ? a - b + mod : a - b; }
void inc(int &a, int b) { a = (a + b >= mod ? a + b - mod : a + b); }
void dec(int &a, int b) { a = (a - b < 0 ? a - b + mod : a - b); }
int n, a[N], sum, cnt[2];
long long ans = 0;
int main() {
  cin >> n;
  for (int i = 1; i <= n; i++) a[i] = __builtin_popcountll(gi());
  cnt[0] = 1;
  for (int i = n; i; i--) {
    int mx = 0, tmp = 0;
    for (int j = i; j <= n && j - i <= 63; j++) {
      mx = max(mx, a[j]);
      tmp += a[j];
      if (tmp % 2 == 0 && mx * 2 > tmp) ans--;
    }
    sum += a[i];
    ans += cnt[sum & 1];
    cnt[sum & 1]++;
  }
  printf("%lld\n", ans);
  return 0;
}
