#include <bits/stdc++.h>
using namespace std;

const int mod = 1000000007;

template <typename T>
struct LazySegmentTree{
    int n;
    vector<T> dat;
    vector<T>lazy;
    LazySegmentTree() {};
    LazySegmentTree(int N) {
        n = 1;
        while(n < N) {
            n *= 2;
        }
        dat.resize(n*2-1,0);
        lazy.resize(n*2-1,0);
    }
    void eval(int k,int l,int r) {
        if(lazy[k] == 0) return;
        if(k < n-1) {
            lazy[k*2+1] += lazy[k];
            lazy[k*2+1] %= mod;
            lazy[k*2+2] += lazy[k];
            lazy[k*2+2] %= mod;
        }
        dat[k] += lazy[k];
        dat[k] %= mod;
        lazy[k] = 0;
    }
    void update(int a, int b, T x, int k, int l, int r) {
        eval(k,l,r);
        if(a <= l && r <= b) {
            lazy[k] += x;
            lazy[k] %= mod;
            eval(k,l,r);
        }
        else if(a < r && l < b) {
            update(a, b, x, k*2+1, l, (l+r)/2);
            update(a, b, x, k*2+2, (l+r)/2, r);
            dat[k] = dat[k*2+1]+dat[k*2+2];
            dat[k] %= mod;
        }
    }
    void update(int a, int b, T x) {//[a,b)
        update(a, b, x, 0, 0, n);
    }
    T query_sub(int a, int b, int k, int l, int r) {
        eval(k,l,r);
        if (r <= a || b <= l) {
            return 0;
        }
        else if (a <= l && r <= b) {
            return dat[k];
        }
        else {
            T vl = query_sub(a, b, k*2+1, l, (l+r)/2);
            T vr = query_sub(a, b, k*2+2, (l+r)/2, r);
            return (vl+vr)%mod;
        }
    }
    T query(int a, int b) {//[a,b)
        return query_sub(a, b, 0, 0, n);
    }
};

int main() {
    int N;
    cin >> N;
    vector<int>A(N),B;
    int sum = 0;
    for(int i = 0; i < N; i++) {
        cin >> A[i];
        sum ^= A[i];
        B.push_back(sum);
    }
    sort(B.begin(),B.end());
    B.erase(unique(B.begin(),B.end()),B.end());
    LazySegmentTree<long long>tree(B.size());
    tree.update(0,B.size(),1);
    sum = 0;
    long long ans = 0;
    for(int i = 0; i < N; i++) {
        sum ^= A[i];
        int it = lower_bound(B.begin(),B.end(),sum)-B.begin();
        long long tmp = tree.query(it,it+1);
        tree.update(it,it+1,-tmp);
        tree.update(0,B.size(),tmp);
        if(A[N-1] == A[i]) {
            ans += tmp;
            ans %= mod;
        }
    }
    cout << ans << endl;
}