#include <iostream>
#include <cassert>
#include <climits>
#include <bitset>
#include <stack>
#include <queue>
#include <iomanip>
#include <limits>
#include <string>
#include <cmath>
#include <set>
#include <map>
#include <math.h>
#include <algorithm>
#include <vector>
#include <string.h>
#include <tuple>
#include <time.h>
#include <random>

using namespace std;

typedef long long ll;
typedef pair<ll,ll> P;

long long int INF = 3e18;
double Pi = 3.1415926535897932384626;

vector<ll> G[500005];
vector<P> tree[500010];
priority_queue <ll> pql;
priority_queue <P> pqp;
//big priority queue
priority_queue <ll,vector<ll>,greater<ll> > pqls;
priority_queue <P,vector<P>,greater<P> > pqps;
//small priority queue
//top pop

int dx[8]={1,0,-1,0,1,1,-1,-1};
int dy[8]={0,1,0,-1,1,-1,-1,1};
char dir[] = "DRUL";
//ll bit[500005];
//↓,→,↑,←


#define p(x) cout<<x<<endl;
#define el cout<<endl;
#define pe(x) cout<<(x)<<" ";
#define ps(x) cout<<fixed<<setprecision(25)<<x<<endl;
#define pu(x) cout<<(x);
#define pd(x) cerr<<"//"<<(x)<<endl;
#define re(i,n) for(i=0;i<n;i++);
#define pb push_back
#define lb lower_bound
#define ub upper_bound
#define deba(x) cout<< #x << " = " << x <<endl


ll mod = 1000000007;
ll rui(ll number1,ll number2){
    if(number2 == 0){
        return 1;
    }else{
        ll number3 = rui(number1,number2 / 2);
        number3 *= number3;
        number3 %= mod;
        if(number2%2==1){
            number3 *= number1;
            number3 %= mod;
        }
        return number3;
    }
}
ll gcd(ll number1,ll number2){
    if(number1 > number2){
        swap(number1,number2);
    }
    if(number1 == 0 || number1 == number2){
        return number2;
    }else{
        return gcd(number2 % number1,number1);
    }
}
void YES(bool condition){
    if(condition){
        p("YES");
    }else{
        p("NO");
    }
    return;
}
void Yes(bool condition){
    if(condition){
        p("Yes");
    }else{
        p("No");
    }
    return;
}
ll  fact[900005];
ll rfact[900005];

void c3_init(){
    fact[0] = rfact[0] = 1;
    for(ll i=1; i<=800000; i++){
        fact[i] = (fact[i-1]*i) % mod;
    }
	rfact[800000] = rui(fact[800000],mod - 2);
	for(ll i=800000; i>=1; i--){
	   rfact[i-1] = rfact[i] * i;
	   rfact[i-1] %= mod;
	}
	return;
}
ll c3(ll n,ll r){
    return (((fact[n] * rfact[r]) % mod) * rfact[n-r]) % mod;
}

ll n,m,num,sum,ans,a,b,c,d,e,g,h,w,i,j,k,q,l,r;
ll x[500005],y[500005],z[1200005];
ll dp[3][1200005];
bool flag,dame;
ll sta;
ll po[1200000];

int main(){
	cin >> n;
	c3_init();
	//p(c3(0,0));
	for(i=0;i<5;i++){
	  // p(fact[i]);
	}
	//el;
	for(i=0;i<5;i++){
	   //p(rfact[i]);
	}
	for(i=0;i<n;i++){
		cin >> x[i];
		sum = (sum ^ x[i]);
	}
	c = 1;
	if(sum != 0){
	   y[0] = 1;
	   for(i=0;i<n;i++){
		  num = num ^ x[i];
		  if(num != sum && num != 0)continue;
		  if(num == 0){
			 y[0] += y[1];
			 y[0] %= mod;
		  }else{
			 y[1] += y[0];
			 y[1] %= mod;
		  }
		}
	   p(y[0]);
	   return 0;
	}else{
		a = 0;
		for(i=0;i<n;i++){
			num = num ^ x[i];
			if(num == 0){
				a++;
			}
		}
		if(a == 1){
			p(n);
			return 0;
		}else{
			ans = 0;
			//0ばかりにするとき
			ans = rui(2,a-1);
			//0以外も入れるとき
			num = 0;
			for(i=1;i<1024*1024+100;i++){
				dp[0][i] = 1;
			}
			for(i=0;i<n;i++){
				num = num ^ x[i];
				if(num != 0){
					if(po[num] < sta){
						dp[0][num] += ((dp[1][num] * (sta - po[num]))%mod);
						dp[0][num] %= mod;
						po[num] = sta;
					}
					dp[1][num] += dp[0][num];
					dp[1][num] %= mod;
				}else{
					//dp[0][num] += dp[1][num];
					sta++;
				}
			}
			//el;
			for(i=1;i<1024*1024+100;i++){
				ans += dp[1][i];
				ans %= mod;
			}
			p(ans);
			return 0;
		}
	}
	return 0;
}

Measured memory_bytes: 71936