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

// macros
#define pb emplace_back
#define mk make_pair
#define FOR(i, a, b) for(int i=(a);i<(b);++i)
#define rep(i, n) FOR(i, 0, n)
#define rrep(i, n) for(int i=((int)(n)-1);i>=0;i--)
#define irep(itr, st) for(auto itr = (st).begin(); itr != (st).end(); ++itr)
#define irrep(itr, st) for(auto itr = (st).rbegin(); itr != (st).rend(); ++itr)
#define whole(x) (x).begin(),(x).end()
#define sz(x) ((int)(x).size())
#define bit(n) (1LL<<(n))
// functions
template <typename T> void unique(T& c){c.erase(std::unique(c.begin(), c.end()), c.end());}
template <class T>bool chmax(T &a, const T &b){if(a < b){a = b; return 1;} return 0;}
template <class T>bool chmin(T &a, const T &b){if(a > b){a = b; return 1;} return 0;}
template <typename T> istream &operator>>(istream &is, vector<T> &vec){for(auto &v: vec)is >> v; return is;}
template <typename T> ostream &operator<<(ostream &os, const vector<T>& vec){for(int i = 0; i < vec.size(); i++){ os << vec[i]; if(i + 1 != vec.size())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const set<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const unordered_set<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const multiset<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const unordered_multiset<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
template <typename T1, typename T2> ostream &operator<<(ostream &os, const pair<T1, T2> &p){os << "(" << p.first << ", " << p.second << ")"; return os;}
template <typename T1, typename T2> ostream &operator<<(ostream &os, const map<T1, T2> &mp){for(auto itr = mp.begin(); itr != mp.end(); ++itr){ os << "(" << itr->first << ", " << itr->second << ")"; auto titr = itr; if(++titr != mp.end())os << " "; } return os;}
template <typename T1, typename T2> ostream &operator<<(ostream &os, const unordered_map<T1, T2> &mp){for(auto itr = mp.begin(); itr != mp.end(); ++itr){ os << "(" << itr->first << ", " << itr->second << ")"; auto titr = itr; if(++titr != mp.end())os << " "; } return os;}
//  types
using ll = long long int;
using P = pair<int, int>;
// constants
const int inf = 1e9;
const ll linf = 1LL << 50;
const double EPS = 1e-10;
const int mod = 1000000007;
const int dx[4] = {-1, 0, 1, 0};
const int dy[4] = {0, -1, 0, 1};
// io
struct fast_io{
  fast_io(){ios_base::sync_with_stdio(false); cin.tie(nullptr); cout << fixed << setprecision(20);}
} fast_io_;

int n;
vector<ll> a;
ll dp[500010];
ll sum[1<<21], jsum[1<<21];

int main(int argc, char const* argv[])
{
  cin >> n;
  a.resize(n); cin >> a;
  auto calc = [&](ll x) -> ll{
    fill(sum, sum + (1<<21), 0LL);
    fill(dp, dp + n + 1, 0LL);
    sum[x] = 1;
    ll acc = x;
    for(int i = n - 1; i >= 0; i--){
      ll q = (acc ^ a[i]) ^ x;
      dp[i] = sum[q];
      (sum[acc ^ a[i]] += dp[i]) %= mod;
      acc ^= a[i];
    }
    return dp[0];
  };
  ll x = 0;
  rep(i, n)x ^= a[i];
  if(x > 0){
    cout << calc(x) << endl;
  }else{
    ll res = 0;
    (res += calc(x));

    fill(sum, sum + (1<<21), 0LL);
    fill(dp, dp + n + 1, 0LL);
    ll acc = 0;
    ll cnt = 0;
    for(int i = n - 1; i >= 0; i--){
      acc ^= a[i];
      if(acc == 0){
        cnt++;
      }else{
        dp[i] = 1;
        (dp[i] += cnt * sum[acc] % mod - jsum[acc]) %= mod;
        (res += dp[i]) %= mod;
        (sum[acc] += dp[i]) %= mod;
        (jsum[acc] += cnt * dp[i]) %= mod;
      }
    }
    if(res < 0)res += mod;
    cout << res << endl;
  }
  return 0;
}


Measured memory_bytes: 34688