#include <stdio.h> #include <atcoder/all> #include <bits/stdc++.h> using namespace std; using namespace atcoder; using mint = modint1000000007; #define rep(i,n) for (int i = 0; i < (n); ++i) #define Inf 1000000000 mint op(mint a,mint b){ return a+b; } mint e(){ return 0; } int main(){ int N; cin>>N; vector<int> A(N); rep(i,N){ cin>>A[i]; } rep(i,N-1){ A[i+1] ^= A[i]; } map<int,vector<int>> mp; rep(i,N){ mp[A[i]].push_back(i); } segtree<mint,op,e> seg(N); rep(i,N){ int d = distance(mp[A[i]].begin(),lower_bound(mp[A[i]].begin(),mp[A[i]].end(),i)); if(d==0){ seg.set(i,seg.all_prod()+1); } else{ int ind = mp[A[i]][d-1]; seg.set(i,seg.prod(ind,i+1)); } } mint ans = 0; rep(i,N){ if(A[i]==A.back())ans += seg.get(i); } cout<<ans.val()<<endl; return 0; }