#include<bits/stdc++.h>
#include<atcoder/all>
using namespace std;
using namespace atcoder;
#define rep(i,n)for (int i = 0; i < int(n); ++i)
#define rrep(i,n)for (int i = int(n)-1; i >= 0; --i)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
template<class T> void chmax(T& a, const T& b) {a = max(a, b);}
template<class T> void chmin(T& a, const T& b) {a = min(a, b);}
using ll = long long;
using P = pair<int,int>;
using VI = vector<int>;
using VVI = vector<VI>;
using VL = vector<ll>;
using VVL = vector<VL>;
using mint = modint1000000007;

int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    int n;
    cin >> n;
    VI a(n);
    rep(i, n) cin >> a[i];
    map<int, VI> m;
    int now = 0;
    m[now].push_back(0);
    rep(i, n) {
        now ^= a[i];
        m[now].push_back(i + 1);
    }
    VI nxt(n + 1, -1);
    for(auto& [k, v]: m) {
        int now = n;
        reverse(all(v));
        for(int i: v) {
            if (i) nxt[now] = i;
            now = i;
        }
    }
    vector<mint> s(n + 1);
    mint cur = 0;
    mint ans = 0;
    rep(i, n) {
        mint t;
        if (i) t += s[i];
        else t += 1;
        if (nxt[i] != -1) t -= s[nxt[i]];
        ans += t;
        s[i + 1] = s[i] + t;
    }
    cout << ans.val() << '\n';
}