#include<bits/stdc++.h>
#define ll long long 
using namespace std;
const int N=1e5+5;
ll a[N],s[N];
ll bin[N][35][2];
int main()
{
    int n,i,j;
    scanf("%d",&n);
    s[0]=0;
    for (i=1;i<=n;i++)  scanf("%lld",&a[i]),s[i]=s[i-1]^a[i];
    for (i=0;i<=n;i++)
        for (j=0;j<=32;j++)
        {
            int x=s[i]>>j&1;
            bin[i][j][x]=bin[i-1][j][x]+1;
            bin[i][j][x^1]=bin[i-1][j][x^1];
        }
    long long sum=0;
    for (i=1;i<=n;i++)
        for (j=0;j<=32;j++)
            sum=sum+(1ll<<j)*bin[i-1][j][s[i]>>j&1^1];
    cout<<sum;
    return 0;
}