// #define _GLIBCXX_DEBUG // for STL debug (optional)
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <string>
#include <cstring>
#include <deque>
#include <list>
#include <queue>
#include <stack>
#include <vector>
#include <utility>
#include <algorithm>
#include <map>
#include <set>
#include <complex>
#include <cmath>
#include <limits>
#include <cfloat>
#include <climits>
#include <ctime>
#include <cassert>
#include <numeric>
#include <fstream>
#include <functional>
#include <bitset>
using namespace std;
using ll = long long int;
using int64 = long long int;
 
template<typename T> void chmax(T &a, T b) {a = max(a, b);}
template<typename T> void chmin(T &a, T b) {a = min(a, b);}
template<typename T> void chadd(T &a, T b) {a = a + b;}
 
int dx[] = {0, 0, 1, -1};
int dy[] = {1, -1, 0, 0};
const int INF = 1LL << 29;
const ll LONGINF = 1LL << 60;
const ll MOD = 1000000007LL;

// ModInt begin

using ll = long long;
template<ll mod>
struct ModInt {
    ll v;
    ll mod_pow(ll x, ll n) const {
        return (!n) ? 1 : (mod_pow((x*x)%mod,n/2) * ((n&1)?x:1)) % mod;
    }
    ModInt(ll a = 0) : v((a %= mod) < 0 ? a + mod : a) {}
    ModInt operator+ ( const ModInt& b ) const {
        return (v + b.v >= mod ? ModInt(v + b.v - mod) : ModInt(v + b.v));
    }
    ModInt operator- () const {
        return ModInt(-v);
    }
    ModInt operator- ( const ModInt& b ) const {
        return (v - b.v < 0 ? ModInt(v - b.v + mod) : ModInt(v - b.v));
    }
    ModInt operator* ( const ModInt& b ) const {return (v * b.v) % mod;}
    ModInt operator/ ( const ModInt& b ) const {return (v * mod_pow(b.v, mod-2)) % mod;}
    
    bool operator== ( const ModInt &b ) const {return v == b.v;}
    bool operator!= ( const ModInt &b ) const {return !(*this == b); }
    ModInt& operator+= ( const ModInt &b ) {
        v += b.v;
        if(v >= mod) v -= mod;
        return *this;
    }
    ModInt& operator-= ( const ModInt &b ) {
        v -= b.v;
        if(v < 0) v += mod;
        return *this;
    }
    ModInt& operator*= ( const ModInt &b ) {
        (v *= b.v) %= mod;
        return *this;
    }
    ModInt& operator/= ( const ModInt &b ) {
        (v *= mod_pow(b.v, mod-2)) %= mod;
        return *this;
    }
    ModInt pow(ll x) { return ModInt(mod_pow(v, x)); }
    // operator int() const { return int(v); }
    // operator long long int() const { return v; }
};

template<ll mod>
ModInt<mod> pow(ModInt<mod> n, ll k) {
    return ModInt<mod>(n.mod_pow(n.v, k));
}

template<ll mod>
ostream& operator<< (ostream& out, ModInt<mod> a) {return out << a.v;}
template<ll mod>
istream& operator>> (istream& in, ModInt<mod>& a) {
    in >> a.v;
    return in;
}

// ModInt end

using mint = ModInt<MOD>;

int main() {
    int N; cin >> N;
    vector<int> A(N);
    for(int i=0; i<N; i++) cin >> A[i];

    vector<int> B(N);
    B[0] = A[0];
    for(int i=1; i<N; i++) B[i] = B[i-1] ^ A[i];

    if(B[N-1] > 0) {
        int X = B[N-1];

        // 0, X
        vector< vector<mint> > dp(N+1, vector<mint>(2, mint(0)));
        dp[0][0] = mint(1);

        mint ans(0);
        for(int i=0; i<N; i++) {
            dp[i+1][0] += dp[i][0];
            dp[i+1][1] += dp[i][1];
            if(B[i] == 0) dp[i+1][0] += dp[i][1];
            if(B[i] == X) dp[i+1][1] += dp[i][0];
        }
        ans = dp[N][0];
        cout << ans << endl;
    }
    else {
        vector<int> zero(N+1);
        for(int i=0; i<N; i++) zero[i+1] = zero[i] + (B[i] == 0);

        vector< vector<int> > pos(1 << 20);
        for(int i=0; i<N; i++) {
            pos[ B[i] ].emplace_back(i);
        }

        mint ans = pow(mint(2), count(B.begin(), B.end(), 0) - 1);
        for(int c=1; c<(1<<20); c++) {
            if(pos[c].size() == 0) continue;
            vector< vector<mint> > dp(pos[c].size() + 1, vector<mint>(2));
            dp[0][0] = mint(1);
            
            for(size_t i=0; i<pos[c].size(); i++) {
                int r = pos[c][i] + 1;
                int l = (i ? pos[c][i-1] : 0);
                int s = zero[r] - zero[l]; // 区間内に 0 は何個？

                mint d0 = dp[i][0] + dp[i][1] * s;
                mint d1 = dp[i][1];

                dp[i+1][0] = d0;
                dp[i+1][1] = d0 + d1;
            }
            ans += dp[pos[c].size()][1];
        }
        cout << ans << endl;
    }
    return 0;
}


Measured memory_bytes: 40308