#include <bits/stdc++.h>
using namespace std;
using lint = long long;
template<class T = int> using V = vector<T>;
template<class T = int> using VV = V< V<T> >;

template<unsigned P> struct ModInt {
  using M = ModInt;
  unsigned v;
  ModInt() : v(0) {}
  ModInt(auto x) : v(x >= 0 ? x % P : (P - -x % P) % P) {}
  constexpr ModInt(unsigned v, int) : v(v) {}
  static constexpr unsigned p() { return P; }
  M operator+() const { return *this; }
  M operator-() const { return {v ? P - v : 0, 0}; }
  explicit operator bool() const noexcept { return v; }
  bool operator!() const noexcept { return !(bool) *this; }
  M operator*(M r) const { return M(*this) *= r; }
  M operator/(M r) const { return M(*this) /= r; }
  M operator+(M r) const { return M(*this) += r; }
  M operator-(M r) const { return M(*this) -= r; }
  bool operator==(M r) const { return v == r.v; }
  bool operator!=(M r) const { return !(*this == r); }
  M& operator*=(M r) { v = (uint64_t) v * r.v % P; return *this; }
  M& operator/=(M r) { return *this *= r.inv(); }
  M& operator+=(M r) { if ((v += r.v) >= P) v -= P; return *this; }
  M& operator-=(M r) { if ((v += P - r.v) >= P) v -= P; return *this; }
  M inv() const {
    int a = v, b = P, x = 1, u = 0;
    while (b) {
      int q = a / b;
      swap(a -= q * b, b);
      swap(x -= q * u, u);
    }
    assert(a == 1);
    return x;
  }
  M pow(auto n) const {
    if (n < 0) return pow(-n).inv();
    M res = 1;
    for (M a = *this; n; a *= a, n >>= 1) if (n & 1) res *= a;
    return res;
  }
  friend M operator*(auto l, M r) { return M(l) *= r; }
  friend M operator/(auto l, M r) { return M(l) /= r; }
  friend M operator+(auto l, M r) { return M(l) += r; }
  friend M operator-(auto l, M r) { return M(l) -= r; }
  friend ostream& operator<<(ostream& os, M r) { return os << r.v; }
  friend istream& operator>>(istream& is, M& r) { lint x; is >> x; r = x; return is; }
  friend bool operator==(auto l, M r) { return M(l) == r; }
  friend bool operator!=(auto l, M r) { return !(l == r); }
};
using Mint = ModInt<(unsigned) 1e9 + 7>;

int main() {
  cin.tie(nullptr); ios::sync_with_stdio(false);
  int n; cin >> n;
  V<> a(n); for (auto&& e : a) cin >> e;
  V<> c(n + 1);
  for (int i = 0; i < n; ++i) c[i + 1] = c[i] ^ a[i];
  if (c[n]) {
    V<Mint> dp0(n + 2), dp1(n + 2);
    dp0[1] = 1;
    for (int i = 1; i <= n; ++i) {
      dp0[i + 1] = dp0[i];
      dp1[i + 1] = dp1[i];
      if (c[i] == c[n]) {
        dp1[i + 1] += dp0[i];
      } else if (!c[i]) {
        dp0[i + 1] += dp1[i];
      }
    }
    cout << dp1[n + 1] - dp1[n] << '\n';
  } else {
    VV<> p(1 << 20);
    for (int i = 1; i < n; ++i) {
      p[c[i]].push_back(i);
    }
    Mint res = Mint(2).pow(p[0].size());
    V<> z(n + 2);
    for (int i = 0; i <= n; ++i) z[i + 1] = z[i] + !c[i];
    for (int x = 1; x < 1 << 20; ++x) {
      int m = p[x].size();
      if (!m) continue;
      V<> b{1};
      for (int i = 0; i < m; ++i) {
        b.push_back(-1);
        if (i == m - 1) break;
        b.push_back(z[p[x][i + 1]] - z[p[x][i]]);
      }
      b.push_back(1);
      m = b.size();
      V<Mint> dp0(m + 1), dp1(m + 1);
      dp0[1] = 1;
      for (int i = 1; i < m; ++i) {
        dp0[i + 1] = dp0[i];
        dp1[i + 1] = dp1[i];
        if (b[i] < 0) {
          dp1[i + 1] += dp0[i];
        } else {
          dp0[i + 1] += dp1[i] * b[i];
        }
      }
      res += dp0[m] - dp0[m - 1];
    }
    cout << res << '\n';
  }
}

Measured memory_bytes: 40308