#include<bits/stdc++.h>
using std::cin;
using std::cout;
using std::endl;
using std::vector;
using ll = long long;
const ll mod = 1e9+7;
#define rep(i,j,k) for(int i=int(j); i<int(k); i++)
#define REP(i,j,k) for(int i=int(j); i<=int(k); i++)

int main(){
    int N; cin >> N;
    vector<int> A(N), B(N+1);
    std::map<int,int> mem;
    rep(i,0,N){
        cin >> A[i];
        B[i+1] = A[i]^B[i];
    }
    vector<int> dp(N);
    dp[0] = 1;
    rep(i,1,N){
        dp[i] = dp[i-1]*2%mod;
        if(mem.count(B[i])){
            dp[i] -= dp[mem[B[i]]-1];
            if(dp[i] < 0) dp[i] += mod;
        }
        mem[B[i]] = i;
    }
    cout << dp[N-1] << endl;
}