#include <algorithm>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <deque>
#include <iostream>
#include <iterator>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>

#define FOR(i,k,n) for(int(i)=(k);(i)<(n);++(i))
#define rep(i,n) FOR(i,0,n)
#define all(v) begin(v),end(v)
#define debug(x) std::cerr<<#x<<": "<<x<<"\n"
#define debug2(x,y) std::cerr<<#x<<": "<<x<<", "<<#y<<": "<<y<<"\n"
#define debug3(x,y,z) std::cerr<<#x<<": "<<x<<", "<<#y<<": "<<y<<", "<<#z<<": "<<z<<"\n"

using ll=long long;
using vi=std::vector<int>;
using vvi=std::vector<vi>;
using vll=std::vector<ll>;
using vvll=std::vector<vll>;
template<typename T> using vvec=std::vector<std::vector<T>>;
template<typename T>
auto make_v(size_t sz){return std::vector<T>(sz);}
template<typename T,typename... Ts>
auto make_v(size_t sz,Ts...ts){return std::vector<decltype(make_v<T>(ts...))>(sz,make_v<T>(ts...));}
template<typename T>
void fill_v(T&var,const T&x){var=x;}
template<typename V,typename T>
void fill_v(V&v,const T&x){for(auto&& w:v){fill_v(w,x);}}

template<typename T> std::ostream& operator<<(std::ostream&s,const std::vector<T>&v){
  int sz=v.size();s<<"\n";rep(i,sz){s<<v[i];if(i<sz-1){s<<"\t";}}s<<"\n";return s;}
template<typename T> std::ostream& operator<<(std::ostream&s,const std::vector<std::vector<T>>&v){
  for(auto&& w:v){s<<w;}return s;}
template<typename T> std::ostream& operator<<(std::ostream&s,const std::deque<T>&v){
  int sz=v.size();s<<"\n";rep(i,sz){s<<v[i];if(i<sz-1){s<<"\t";}}s<<"\n";return s;}
template<typename T> std::ostream& operator<<(std::ostream&s,const std::deque<std::deque<T>>&v){
  for(auto&& w:v){s<<w;}return s;}
template<typename T> std::ostream& operator<<(std::ostream&s, const std::set<T>&v){
  s<<"\n";for(auto&& elm:v){s<<elm<<"\t";}s<<"\n";return s;}

inline void scan(int&a){scanf("%d",&a);}
inline void scan(ll&a){scanf("%lld",&a);}
inline void scan(char&a){scanf(" %c",&a);}
inline void scan(double&a){scanf("%lf",&a);}
inline void scan(std::string&s){char BUF[3000000];scanf(" %s",BUF);s=std::string(BUF);}
template<typename T>
inline void scan(std::vector<T>&v){for(auto&& sv:v){scan(sv);}}
template<typename First,typename...Args>
inline void scan(First&f,Args&...args){scan(f);scan(args...);}
inline void print(int a){printf("%d\n",a);}
inline void print(ll a){printf("%lld\n",a);}
inline void print(double a){printf("%.12f\n",a);}
inline void print(std::string s){std::cout<<s<<"\n";}

using namespace std;

ll mod = 1000000007;
int t20 = 1048576;
ll po(ll k, ll x) {
  if (x == 0) {
    return 1;
  }
  if (x == 1) {
    return k % mod;
  }
  ll y = po(k, x/2);
  y = y * y % mod;
  if (x % 2 == 1) {
    y = y * k % mod;
  }
  return y;
}

ll po2(ll x) {
  return po(2, x);
}

int main() {
  int n;
  scan(n);
  vi a(n);
  scan(a);

  vi beauty(n+1, 0);
  rep (i, n) {
    beauty[i+1] = beauty[i] ^ a[i];
  }
  vvi ind(t20, vi());
  rep (i, n+1) {
    ind[beauty[i]].push_back(i);
  }

  ll ans = 0;
  if (beauty[n] != 0) {
    int sz = ind[beauty[n]].size();
    vi zind(sz);
    rep (i, sz) {
      zind[i] = lower_bound(all(ind[0]), ind[beauty[n]][i]) - begin(ind[0]);
    }
    //debug(beauty);

    vll dp(2, 0);
    dp[0] = 1;
    rep (i, sz-1) {
      int znum = zind[i+1] - zind[i];
      vll next_dp(2, 0);
      next_dp[0] = (dp[0] * (znum + 1) + dp[1] * znum) % mod;
      next_dp[1] = (dp[0] * 1 + dp[1] * 1) % mod;
      swap(dp, next_dp);
      //debug(dp);
    }
    ans = dp[0];
  } else {
    ans = po2((int)ind[0].size() - 2);
    FOR (i, 1, t20) {
      int sz = ind[i].size();
      if (sz == 0) {
        continue;
      }
      vi zind(sz);
      rep (j, sz) {
        zind[j] = lower_bound(all(ind[0]), ind[i][j]) - begin(ind[0]);
      }

      vll dp(2, 0);
      dp[0] = 1;
      rep (j, sz-1) {
        int znum = zind[j+1] - zind[j];
        vll next_dp(2, 0);
        next_dp[0] = (dp[0] * (znum + 1) + dp[1] * znum) % mod;
        next_dp[1] = (dp[0] * 1 + dp[1] * 1) % mod;
        swap(dp, next_dp);
      }
      ll add = (dp[1] + dp[0]) % mod;
      ans = (ans + add) % mod;
      //debug2(i, ans);
    }
  }
  print(ans);

  return 0;
}


Measured memory_bytes: 38388