#include <bits/stdc++.h>
using namespace std;
inline bool isvowel(char c) {
  c = tolower(c);
  if (c == 'a' || c == 'e' || c == 'i' || c == 'y' || c == 'o' || c == 'u')
    return 1;
  return 0;
}
const double eps = 0.000001;
const long double pi = acos(-1);
const int maxn = 1e7 + 9;
const int mod = 1e9 + 7;
const long long MOD = 1e18 + 9;
const long long INF = 1e18 + 123;
const int inf = 2e9 + 11;
const int mxn = 1e6 + 9;
const int N = 6e5 + 123;
const int M = 22;
const int pri = 997;
const int Magic = 2101;
const int dx[] = {-1, 0, 1, 0};
const int dy[] = {0, -1, 0, 1};
int n;
long long a[N];
int main() {
  cin >> n;
  for (long long i = 1; i <= n; i++) {
    long long x;
    cin >> x;
    a[i] = __builtin_popcountll(x);
  }
  long long res = 0;
  for (long long i = 1; i <= n; i++) {
    long long sum = 0, mx = 0;
    for (long long j = i; j <= n; j++) {
      if (j - i > 61) break;
      sum += a[j];
      mx = max(mx, a[j]);
      if (sum % 2 == 0 && sum - mx < mx) ++res;
    }
  }
  long long c1 = 0, c2 = 1, sum = 0;
  for (long long i = 1; i <= n; i++) {
    sum ^= (a[i] & 1);
    if (sum)
      c1++;
    else
      c2++;
  }
  cout << c1 * (c1 - 1) / 2ll + c2 * (c2 - 1) / 2ll - res;
  return 0;
}
