#include <bits/stdc++.h>
using namespace std;
typedef long long ll;

const ll M=1e9+7;
const int N=300010;
ll dp[N],sumdp[N],sumdpi[N],fsum[N][64],a[N];

void solve(){
    int n;cin>>n;
    for(int i=1;i<=n;i++)cin>>a[i],a[i]^=a[i-1];
    dp[0]=1;
    sumdp[0]=1;

    for(int i=1;i<=n;i++){
        dp[i]=sumdp[i-1]*(a[i]%M)%M;
        dp[i]=(dp[i]+sumdpi[i-1])%M;
        for(int j=0;j<=60;j++){
            dp[i]=(dp[i]-((a[i]>>j&1)<<(j+1))%M*fsum[i-1][j]%M+M)%M;
        }

        sumdp[i]=(sumdp[i-1]+dp[i])%M;
        sumdpi[i]=(sumdpi[i-1]+dp[i]*(a[i])%M)%M;
        for(int j=0;j<=60;j++){
            fsum[i][j]=(fsum[i-1][j]+dp[i]*(a[i]>>j&1))%M;
        }
    }
    // for(int i=1;i<=n;i++)cout<<dp[i]<<" ";
    // cout<<"\n";
    cout<<dp[n]<<"\n";
}

int main(){
    ios::sync_with_stdio(0);
    cin.tie(0);cout.tie(0);
    int n=1;
    // cin>>n;
    while(n--)solve();
    return 0;
}