#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < n; i++)
#define rep2(i, x, n) for(int i = x; i <= n; i++)
#define rep3(i, x, n) for(int i = x; i >= n; i--)
#define elif else if
#define sp(x) fixed << setprecision(x)
#define pb push_back
#define eb emplace_back
#define all(x) x.begin(), x.end()
#define sz(x) (int)x.size()
using ll = long long;
using ld = long double;
using pii = pair<int, int>;
using pil = pair<int, ll>;
using pli = pair<ll, int>;
using pll = pair<ll, ll>;
const ll MOD = 1e9+7;
//const ll MOD = 998244353;
const int inf = (1<<30)-1;
const ll INF = (1LL<<60)-1;
const ld EPS = 1e-10;
template<typename T> bool chmax(T &x, const T &y) {return (x < y)? (x = y, true) : false;};
template<typename T> bool chmin(T &x, const T &y) {return (x > y)? (x = y, true) : false;};

template<ll mod> struct Mod_Int{
    ll x;
    Mod_Int() {}
    Mod_Int(ll y) : x (y >= 0 ? y % mod : (mod - (-y) % mod) % mod) {}

    Mod_Int &operator += (const Mod_Int &p) {
        x = (x + p.x) % mod;
        return *this;
    }

    Mod_Int &operator -= (const Mod_Int &p) {
        x = (x + mod - p.x) % mod;
        return *this;
    }

    Mod_Int &operator *= (const Mod_Int &p) {
        x = (x * p.x) % mod;
        return *this;
    }

    Mod_Int &operator /= (const Mod_Int &p) {
        *this *= p.inverse();
        return *this;
    }

    Mod_Int &operator ++ () {return *this += (Mod_Int)1;}

    Mod_Int operator ++ (int) {
        Mod_Int tmp = *this;
        ++*this;
        return tmp;
    }

    Mod_Int &operator -- () {return *this -= (Mod_Int)1;}

    Mod_Int operator -- (int) {
        Mod_Int tmp = *this;
        --*this;
        return tmp;
    }

    Mod_Int operator - () const {return Mod_Int(-x);}

    Mod_Int operator + (const Mod_Int &p) const {return Mod_Int(*this) += p;}

    Mod_Int operator - (const Mod_Int &p) const {return Mod_Int(*this) -= p;}

    Mod_Int operator * (const Mod_Int &p) const {return Mod_Int(*this) *= p;}

    Mod_Int operator / (const Mod_Int &p) const {return Mod_Int(*this) /= p;}

    bool operator == (const Mod_Int &p) const {return x == p.x;}

    bool operator != (const Mod_Int &p) const {return x != p.x;}

    Mod_Int pow (ll n) const {
        Mod_Int now = *this, ret = 1;
        while(n > 0){
            if(n & 1) ret *= now;
            now *= now, n >>= 1;
        }
        return ret;
    }

    Mod_Int inverse () const {
        return pow(mod-2);
    }
};

using mint = Mod_Int<MOD>;

int main(){
    int N;
    cin >> N;
    int A[N];
    rep(i, N){
        cin >> A[i];
        if(i > 0) A[i] ^= A[i-1];
    }
    vector<int> ids[1<<20];
    vector<mint> sum1(1<<20, 0), sum2(1<<20, 0);
    vector<mint> dp(N, 0); //dp[i]:=(A[i]!=0のとき)i個目までの要素を分割する方法
    mint num[N+1]; //0の数
    num[0] = 0;
    rep(i, N) num[i+1] = num[i]+(A[i] == 0);
    rep(i, N){
        if(ids[A[i]].empty()){
            ids[A[i]].pb(i);
            dp[i] = 1;
            sum1[A[i]] = 1;
            continue;
        }
        if(A[i] == 0){
            dp[i] = sum1[0]+1;
            sum1[0] += dp[i];
            ids[0].pb(i);
            continue;
        }
        int j = ids[A[i]][sz(ids[A[i]])-1];
        mint n = num[i]-num[j+1];
        sum2[A[i]] += n*sum1[A[i]];
        dp[i] = sum2[A[i]]+1;
        sum1[A[i]] += dp[i];
        ids[A[i]].pb(i);
    }
    //rep(i, N) cout << dp[i].x << ' '; cout << endl;
    if(A[N-1] > 0) cout << dp[N-1].x << endl;
    else{
        mint ans = dp[N-1];
        rep(i, N){
            if(A[i] != 0) ans += dp[i];
        }
        cout << ans.x << endl;
    }
}

Measured memory_bytes: 60660