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

#define ll long long int
#define mod 1000000007



int main() {
	int t=1;
	//cin>>t;
	assert(t>=1&&t<=10);
	while(t--){
		int n,i,j;
		cin>>n;
		//assert(n>=1&&n<=100000);
		int a[n];
		int b[n+1];
		b[0]=0;
		for(i=0;i<n;i++){
			cin>>a[i];
			//assert(a[i]>=0&&a[i]<=1000000000);
			b[i+1]=b[i]^a[i];
		}
		map<int,int>m;
		ll dp[n];
		dp[0]=1;
		for(i=1;i<n;i++){
			dp[i]=(dp[i-1]*2)%mod;
			if(m.find(b[i])!=m.end()){
				dp[i]=(dp[i]-dp[m[b[i]]-1]+mod)%mod;

			}
			m[b[i]]=i;

		}
		cout<<dp[n-1]%mod<<"\n";



	}
	
}