#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){
		if(mp[A[i]].size()==0){
			mp[A[i]].push_back(0);
		}
		mp[A[i]].push_back(i+1);
	}
	
	segtree<mint,op,e> seg(N+1);
	seg.set(0,1);
	
	rep(i,N){
		int d = distance(mp[A[i]].begin(),lower_bound(mp[A[i]].begin(),mp[A[i]].end(),i+1));
		int ind = mp[A[i]][d-1];
		seg.set(i+1,seg.prod(ind,i+1));
	}
	
	mint ans = seg.get(N);
	
	cout<<ans.val()<<endl;
	
	
    return 0;
}