#include <bits/stdc++.h>
#include <atcoder/modint>
using namespace std;
using namespace atcoder;
using ll = long long;
using mint = modint1000000007;

int main() {
  ios::sync_with_stdio(false);
  cin.tie(nullptr);

  ll N;
  cin >> N;

  vector<ll> A(N), X{0};
  for(auto &i : A) {
    cin >> i;
    X.emplace_back(X.back() ^ i);
  }
  X.erase(X.begin());
  X.pop_back();

  vector<mint> dp(N, 0), sp(N + 1, 0);
  dp[0] = sp[1] = 1;
  unordered_map<ll, ll> r;
  for(ll i = 0; i < N - 1; i++) {
    if(r.contains(X[i])) { dp[i + 1] = sp[i + 1] - sp[r[X[i]] + 1]; }
    else { dp[i + 1] = sp[i + 1]; }
    r[X[i]] = i;
    sp[i + 2] = sp[i + 1] + dp[i + 1];
  }

  cout << sp[N].val() << "\n";
}