#include <iostream>
#include <string>
#include <cstring>
#include <cstdlib>
#include <cmath>
#include <algorithm>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <list>
#include <iterator>
#include <cassert>
#include <numeric>
#include <functional>
#include <ctime>
#pragma warning(disable:4996) 

#define ATCODER
#ifdef ATCODER
#include <atcoder/all>
#endif

typedef long long ll;
typedef unsigned long long ull;
#define LINF  9223300000000000000
#define LINF2 1223300000000000000
#define LINF3 1000000000000
#define INF 2140000000
const long long MOD = 1000000007;
//const long long MOD = 998244353;

using namespace std;
#ifdef ATCODER
using namespace atcoder;
#endif


void solve()
{
    int n;
    scanf("%d", &n);
    vector<int> a(n), s(n + 1);
    for (int i = 0; i < n; i++) {
        scanf("%d", &a[i]);
        s[i + 1] = (s[i]^a[i]);
    }
    vector<int> pr(n+1, -1);
    map<int, int> z;  // val->id
    for (int i = 0; i <= n; i++) {
        auto it = z.find(s[i]);
        if (it != z.end()) {
            pr[i] = it->second;
        }
        z[s[i]] = i;
    }

    vector<ll> dp(n + 1), sdp(n + 2);
    dp[0] = sdp[1] = 1;
    for (int i = 1; i <= n; i++) {
        int bgn = (pr[i] < 0 ? 0 : pr[i]);
        dp[i] = (sdp[i] - sdp[bgn] + MOD) % MOD;
        sdp[i + 1] = (sdp[i] + dp[i])%MOD;
    }
    ll ans = 0;
    for (int i = 1; i <= n; i++) {
        if(s[i]==s[n])
        ans = (ans + dp[i]) % MOD;
    }
    printf("%lld\n", ans);

    return;
}


int main()
{
#if 1
    solve();
#else
    int T, t;
    scanf("%d", &T);
    for (t = 0; t < T; t++) {
        //cout << "Case #" << t + 1 << ": ";
        solve();
    }
#endif
    return 0;
}