#include <bits/stdc++.h>

using namespace std;

#define X first

#define Y second

#define pb push_back

typedef double db;

typedef long long ll;

typedef pair<int,int> P;

const int MAXN=5e5+;

ll n,x,cnt[MAXN],pre[MAXN],odd,even,res;

int main()

{

    scanf("%d",&n);

    for(int i=;i<=n;i++)

    {

        scanf("%lld",&x);

        while(x) cnt[i]+=x&,x>>=;

    }

    for(int i=;i<=n;i++)

        pre[i]=pre[i-]+cnt[i];

    for(int i=;i<=n;i++)

    {

        if(pre[i]%==)

            res+=even+,even++;

        else res+=odd,odd++;

        res-=(pre[i]%==pre[i-]%);

    }

    for(int i=;i<=n;i++)

    {

        ll sum=cnt[i],mx=cnt[i];

        for(int j=i-;j>=&&j>=i-;j--)

        {

            sum+=cnt[j];mx=max(cnt[j],mx);

            if(mx>sum-mx&&sum%==) res--;

        }

    }

    printf("%lld",res);

    return ;

}