#include <bits/stdc++.h>
const int N = (int)3e5 + 1;
const int N_ = (int)1e3 + 1;
const int MAXN = (int)4e6 + 7;
const int MOD = (int)1e9;
const int INF = (int)2e9;
const int DEL = (int)3e5;
const int LOG = 20;
const int ALPH = 256;
const int DIGIT = 10;
const int BLOCK = 300;
const int LIGHT = 650;
const long long LINF = (int64_t)2e18;
const long double PI = 3.1415926535897932384626433832795;
const long double EPS = 1e-2;
using namespace std;
template <typename T>
T sqr(T a) {
  return a * a;
}
template <typename T>
bool uax(T &a, const T b) {
  if (a < b) {
    a = b;
    return true;
  }
  return false;
}
template <typename T>
bool uin(T &a, const T b) {
  if (a > b) {
    a = b;
    return true;
  }
  return false;
}
template <typename T1, typename T2>
istream &operator>>(istream &in, pair<T1, T2> &p) {
  in >> p.first >> p.second;
  return in;
}
template <typename T1, typename T2>
ostream &operator<<(ostream &out, pair<T1, T2> &p) {
  out << p.first << ' ' << p.second;
  return out;
}
int n, a[N], cnt[N];
void read() {
  cin >> n;
  for (int i = 0; i < n; i++) cin >> a[i];
}
void solve() {
  for (int i = 0; i < n; i++) {
    while (a[i]) {
      cnt[i] += a[i] & 1;
      a[i] >>= 1;
    }
  }
  long long ans = 0;
  int even = 1, odd = 0, sum = 0;
  for (int i = 0; i < n; i++) {
    sum += cnt[i];
    if (sum & 1)
      ans += odd++;
    else
      ans += even++;
  }
  for (int i = 0; i < n; i++) {
    int bit = 0, mx = 0;
    for (int j = i; j < n && bit < 140; j++) {
      uax(mx, cnt[j]);
      bit += cnt[j];
      if (mx * 2 > bit && bit % 2 == 0) ans--;
    }
  }
  cout << ans;
}
void check_time() {
  double start = clock();
  read(), solve();
  cout << "\nTime is " << (clock() - start) * 1.0 / CLOCKS_PER_SEC << "s\n";
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  cout << fixed << setprecision(20);
  read();
  solve();
}
