#include<bits/stdc++.h>
#define ll long long
#define N 300005
#define mod 1000000007
using namespace std;
ll read(){
    ll x=0,f=1;char ch=getchar();
    while(ch<'0' && ch>'9')f=(ch=='-'?-1:f),ch=getchar();
    while(ch>='0' && ch<='9')x=(x<<1)+(x<<3)+(ch^48),ch=getchar();
    return x*f;
}
void write(ll x){
    if(x<0)x=-x,putchar('-');
    if(x/10)write(x/10);
    putchar(x%10+'0');
}
ll a[N];
ll g[N][2];
void insert(ll it,ll c){
    for(ll i=62;i>=0;i--){
        ll j=(it&(1ll<<i)?1:0);
        g[i][j]=(g[i][j]+c)%mod;
    }
}
ll ask(ll it){
    ll res=0;
    for(ll i=62;i>=0;i--){
        ll j=(it&(1ll<<i)?1:0);
        res+=(g[i][j^1]*((1ll<<i)%mod))%mod;
    }
    return res;
}
ll f[N];
int main(){
    #ifdef EAST_CLOUD
    freopen("a.in","r",stdin);
    freopen("a.out","w",stdout);
    #endif
    ll n=read();
    for(ll i=1;i<=n;i++)a[i]=read(),a[i]^=a[i-1];
    insert(0,1);
    for(ll i=1;i<=n;i++){
        f[i]=ask(a[i]);insert(a[i],f[i]);
        //cerr<<i<<' '<<f[i]<<' '<<a[i]<<endl;
    }
    write(f[n]);
}