#include <iostream>
#include <vector>
#include <cstdio>
#include <sstream>
#include <map>
#include <string>
#include <algorithm>
#include <queue>
#include <cmath>
#include <functional>
#include <set>
#include <ctime>
#include <random>
#include <chrono>
#include <cassert>
#include <tuple>
#include <utility>
using namespace std;

namespace {
  using Integer = long long; //__int128;
  template<class T, class S> istream& operator >> (istream& is, pair<T,S>& p){return is >> p.first >> p.second;}
  template<class T> istream& operator >> (istream& is, vector<T>& vec){for(T& val: vec) is >> val; return is;}
  template<class T> istream& operator ,  (istream& is, T& val){ return is >> val;}
  template<class T, class S> ostream& operator << (ostream& os, const pair<T,S>& p){return os << p.first << " " << p.second;}
  template<class T> ostream& operator << (ostream& os, const vector<T>& vec){for(size_t i=0; i<vec.size(); i++) os << vec[i] << (i==vec.size()-1?"":" "); return os;}
  template<class T> ostream& operator ,  (ostream& os, const T& val){ return os << " " << val;}

  template<class H> void print(const H& head){ cout << head; }
  template<class H, class ... T> void print(const H& head, const T& ... tail){ cout << head << " "; print(tail...); }
  template<class ... T> void println(const T& ... values){ print(values...); cout << endl; }

  template<class H> void eprint(const H& head){ cerr << head; }
  template<class H, class ... T> void eprint(const H& head, const T& ... tail){ cerr << head << " "; eprint(tail...); }
  template<class ... T> void eprintln(const T& ... values){ eprint(values...); cerr << endl; }

  class range{ Integer start_, end_, step_; public: struct range_iterator{ Integer val, step_; range_iterator(Integer v, Integer step) : val(v), step_(step) {} Integer operator * (){return val;} void operator ++ (){val += step_;} bool operator != (range_iterator& x){return step_ > 0 ? val < x.val : val > x.val;} }; range(Integer len) : start_(0), end_(len), step_(1) {} range(Integer start, Integer end) : start_(start), end_(end), step_(1) {} range(Integer start, Integer end, Integer step) : start_(start), end_(end), step_(step) {} range_iterator begin(){ return range_iterator(start_, step_); } range_iterator   end(){ return range_iterator(  end_, step_); } };

  inline string operator "" _s (const char* str, size_t size){ return move(string(str)); }
  constexpr Integer my_pow(Integer x, Integer k, Integer z=1){return k==0 ? z : k==1 ? z*x : (k&1) ? my_pow(x*x,k>>1,z*x) : my_pow(x*x,k>>1,z);}
  constexpr Integer my_pow_mod(Integer x, Integer k, Integer M, Integer z=1){return k==0 ? z%M : k==1 ? z*x%M : (k&1) ? my_pow_mod(x*x%M,k>>1,M,z*x%M) : my_pow_mod(x*x%M,k>>1,M,z);}
  constexpr unsigned long long operator "" _ten (unsigned long long value){ return my_pow(10,value); }

  inline int k_bit(Integer x, int k){return (x>>k)&1;} //0-indexed

  mt19937 mt(chrono::duration_cast<chrono::nanoseconds>(chrono::steady_clock::now().time_since_epoch()).count());

  template<class T> string join(const vector<T>& v, const string& sep){ stringstream ss; for(size_t i=0; i<v.size(); i++){ if(i>0) ss << sep; ss << v[i]; } return ss.str(); }

  inline string operator * (string s, int k){ string ret; while(k){ if(k&1) ret += s; s += s; k >>= 1; } return ret; }
}
constexpr long long mod = 9_ten + 7;

int main(){
  int n;
  cin >> n;
  vector<int> a(n);
  cin >> a;

  vector<int> b(n+1, 0); // (0, i) xor
  for(int i=1; i<=n; i++){
    b[i] = a[i-1] ^ b[i-1];
  }

  vector<int> zeros(n+1, 0);
  for(int i=0; i<n; i++){
    zeros[i] = (b[i+1] == 0 ? 1 : 0);
    if(i) zeros[i] += zeros[i-1];
  }

  vector<vector<int>> check_point(*max_element(b.begin(), b.end()) + 1);
  for(int i=1; i<=n; i++){
    check_point[b[i]].push_back(i-1);
  }

  if(b[n] == 0){
    vector<bool> checked(1<<21);
    long long ans = 0;
    cerr << "hoge" << endl;
    for(int i=0; i<n; i++){
      int x = b[i+1];
      int y = b[n] ^ x;
      if(y != 0 && y != x) continue;

      if(x == 0){
        if(checked[x]) continue;
        int len = check_point[x].size() - 1;
        ans += my_pow_mod(2, len, mod);
        ans %= mod;
      }else if(y == x){
        if(checked[x]) continue;
        vector<long long> dp(2, 0);
        auto& cp = check_point[x];
        for(int j=0; j<cp.size(); j++){
          vector<long long> dp_(2, 0);
          int r = cp[j];
          if(j){
            int l = cp[j-1];
            int z = zeros[r] - zeros[l];
            dp_[0] += dp[0] + dp[1] * z;
            dp_[0] %= mod;
            dp_[1] += dp[1] + dp_[0];
          }else{
            dp_ = dp;
          }
          dp_[1] += 1;
          dp_[1] %= mod;
          swap(dp, dp_);
        }
        // eprintln(x, dp[1]);
        ans += dp[1];
        ans %= mod;
      }
      checked[x] = true;
    }
    println(ans);
  }

  if(b[n] != 0){
    vector<bool> checked(1<<21);

    long long ans = 0;
    for(int i=0; i<n; i++){ // [0, i] - first segment
      int x = b[i+1];
      int y = b[n];
      if(y != 0 && y != x) continue;

      if(x == 0){
        if(checked[x]) continue;
        int len = check_point[0].size() - 1;
        ans += my_pow_mod(2, len, mod);
        ans %= mod;
      }else if(y == 0){

      }else if(y == x){

      }

      checked[x] = true;
    }

    vector<int> s(check_point.size(), -1);
    vector<int> w;
    for(int i=1; i<check_point.size(); i++){
      if(checked[i] == false) continue;
      s[i] = w.size();
      w.push_back(i);
    }

    vector<vector<long long>> dp(w.size(), vector<long long>(2, 0));
    for(int i=0; i<w.size(); i++){
      dp[i][0] = 1;
    }
    for(int i=1; i<n; i++){
      if(b[i] == 0){
        int j = i;
        while(j+1<n && b[j+1] == 0){
          j++;
        }
        int k = j-i+1;

        for(int l=0; l<w.size(); l++){
          dp[l][0] += k * dp[l][1];
          if(dp[l][0] >= mod) dp[l][0] %= mod;
        }
        i = j;
      }else if(checked[b[i]]){
        int j = s[b[i]];
        dp[j][1] += dp[j][0];
        if(dp[j][1] >= mod) dp[j][1] %= mod;
      }
    }

    if(b[n] == 0){
      for(int l=0; l<w.size(); l++){
        // eprintln(w[l], dp[l][1]);
        ans += dp[l][1];
        ans %= mod;
      }
    }else{
      for(int l=0; l<w.size(); l++){
        if(w[l] == b[n]){
          ans += dp[l][0];
          ans %= mod;
        }
      }
    }

    println (ans);
  }

  return 0;
}


Measured memory_bytes: 43252