#include"bits/stdc++.h"

using namespace std;
using ll=long long ;



const int mod = 1000000007;
struct Mod {
public:
	int num;
	Mod() : Mod(0) { ; }
	Mod(long long int n) : num((n % mod + mod) % mod) {
		static_assert(mod<INT_MAX / 2, "mod is too big, please make num 'long long int' from 'int'");
	}
	Mod(int n) : Mod(static_cast<long long int>(n)) { ; }
	operator int() { return num; }
};

Mod operator+(const Mod a, const Mod b) { return Mod((a.num + b.num) % mod); }
Mod operator+(const long long int a, const Mod b) { return Mod(a) + b; }
Mod operator+(const Mod a, const long long int  b) { return b + a; }
Mod operator++(Mod &a) { return a + Mod(1); }
Mod operator-(const Mod a, const Mod b) { return Mod((mod + a.num - b.num) % mod); }
Mod operator-(const long long int a, const Mod b) { return Mod(a) - b; }
Mod operator--(Mod &a) { return a - Mod(1); }
Mod operator*(const Mod a, const Mod b) { return Mod(((long long)a.num * b.num) % mod); }
Mod operator*(const long long int a, const Mod b) { return Mod(a)*b; }
Mod operator*(const Mod a, const long long int b) { return Mod(b)*a; }
Mod operator*(const Mod a, const int b) { return Mod(b)*a; }
Mod operator+=(Mod &a, const Mod b) { return a = a + b; }
Mod operator+=(long long int &a, const Mod b) { return a = a + b; }
Mod operator-=(Mod &a, const Mod b) { return a = a - b; }
Mod operator-=(long long int &a, const Mod b) { return a = a - b; }
Mod operator*=(Mod &a, const Mod b) { return a = a * b; }
Mod operator*=(long long int &a, const Mod b) { return a = a * b; }
Mod operator*=(Mod& a, const long long int &b) { return a = a * b; }
Mod operator^(const Mod a, const int n) {
	if (n == 0) return Mod(1);
	Mod res = (a * a) ^ (n / 2);
	if (n % 2) res = res * a;
	return res;
}
Mod mod_pow(const Mod a, const int n) {
	if (n == 0) return Mod(1);
	Mod res = mod_pow((a * a), (n / 2));
	if (n % 2) res = res * a;
	return res;
}
Mod inv(const Mod a) { return a ^ (mod - 2); }
Mod operator/(const Mod a, const Mod b) {
	assert(b.num != 0);
	return a * inv(b);
}
Mod operator/(const long long int a, const Mod b) {
	return Mod(a) / b;
}
Mod operator/=(Mod &a, const Mod b) {
	return a = a / b;
}

#define MAX_MOD_N 1024000

Mod fact[MAX_MOD_N], factinv[MAX_MOD_N];
void init(const int amax = MAX_MOD_N) {
	fact[0] = Mod(1); factinv[0] = 1;
	for (int i = 0; i < amax - 1; ++i) {
		fact[i + 1] = fact[i] * Mod(i + 1);
		factinv[i + 1] = factinv[i] / Mod(i + 1);
	}
}
Mod comb(const int a, const int b) {
	return fact[a] * factinv[b] * factinv[a - b];
}
  
int main(){
  init();
  int N;cin>>N;
  vector<int>v(N);
  vector<int>xors;
  for(int i=0;i<N;++i)cin>>v[i];
  vector<vector<int>>places(1<<20);
  int sum=0;
  for(int i=0;i<N;++i){
    sum^=v[i];
    if(i!=N-1)places[sum].push_back(i+1);
    xors.push_back(sum);
    //cout<<xors[i]<<endl;
  }
  int total_sum=sum;
  Mod answer=0;
  if(total_sum==0){
    //odd
    int zero_cnt=places[0].size();
    for(int i=0;i<=zero_cnt;i+=1){
      answer+=comb(zero_cnt,i);
    }
    // cout<<answer.num<<endl;

    //even

 
    for(int i=1;i<(1<<20);++i){
      Mod zz=1;
      Mod oo=0;
      int pre_zero_cnt=0;
      for(auto p:places[i]){
	int now_zero_cnt=lower_bound(places[0].begin(),places[0].end(),p)-places[0].begin();
	int cnt=now_zero_cnt-pre_zero_cnt;
	Mod n_zz=zz+oo*cnt;
	Mod n_oo=oo+oo*cnt+zz;

	zz=n_zz;
	oo=n_oo;
	pre_zero_cnt=now_zero_cnt;
      }
      Mod plus=oo;
      if(plus.num!=0){
        //cout<<i<<" ; "<<plus.num<<endl;
      }
      answer+=plus;
    }
  }else{
    //odd
    {
      int i=total_sum;
      Mod zz=1;
      Mod oo=0;
      for(int x=0;x<N-1;++x){
	if(xors[x]==0)zz+=oo;
	else if(xors[x]==total_sum)oo+=zz;
      }
      answer=zz;
    }
  }
  cout<<answer.num<<endl;

  return 0;
}


Measured memory_bytes: 46320