#pragma GCC optimize("Ofast")
#include <iostream>
#include <vector>
#include <algorithm>
#include <map>
#include <queue>
#include <cstdio>
#include <ctime>
#include <assert.h>
#include <chrono>
#include <random>
#include <numeric>
#include <set>
#include <deque>
#include <stack>
#include <sstream>
#include <utility>
#include <cstring>
#include <unordered_map>
#include <unordered_set>
#include <tuple>
#include <array>
#include <bitset>
using namespace std;
typedef long long int ll;
typedef unsigned long long ull;

mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
ll myRand(ll B) {
    return (ull)rng() % B;
}
inline double time() {
    return static_cast<double>(chrono::duration_cast<chrono::nanoseconds>(chrono::steady_clock::now().time_since_epoch()).count()) * 1e-9;
}

constexpr ll mod = 1e9+7;

int main(){
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    int n; cin >> n;
    vector<int> a(n),b(n+1);
    for(int i=0;i<n;i++){
        cin >> a[i];
        b[i+1] = a[i] ^ b[i];
    }
    vector<int> dp(n);
    dp[0] = 1;
    map<int,int> last;
    for(int i=1;i<n;i++){
        dp[i] = dp[i-1] * 2 % mod;
        if(last.find(b[i]) != last.end()){
            dp[i] -= dp[last[b[i]]-1];
            if(dp[i] < 0){
                dp[i] += mod;
            }
        }
        last[b[i]] = i;
    }
    cout << dp.back() << endl;
}