#include <algorithm>
#include <cassert>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <iostream>
#include <numeric>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <functional>
#include <iomanip>
using namespace std;
using ll = long long;

class range {private: struct I{int x;int operator*(){return x;}bool operator!=(I& lhs){return x<lhs.x;}void operator++(){++x;}};I i,n;
public:range(int n_):i({0}),n({n_}){}range(int i_,int n_):i({i_}),n({n_}){}I& begin(){return i;}I& end(){return n;}};


template<class T, class U> ostream& operator<<(ostream& os, const pair<T, U>& p){ return os << "{" << p.first << ", " << p.second << "}"; }
template<typename T> ostream& operator<<(ostream& os, const vector<T>& obj) { os << "{"; for (const auto& e : obj) os << e << ", "; return os << "}"; }
template<typename T> ostream& operator<<(ostream& os, const set<T>& obj) { os << "set{"; for (const auto& e : obj) os << e << ", "; return os << "}"; }
template<typename T, typename U> ostream& operator<<(ostream& os, const map<T, U>& obj) { os << "map{"; for (const auto& e : obj) os << e << ", "; return os << "}"; }

#ifdef ONLINE_JUDGE
#define dump(expr) ;
#else
#define dump(expr) { cerr << "\033[33m#L" << __LINE__ << ": " << expr << "\033[39m" << endl; }
#endif

const ll mod = 1000000007;
struct mint {
  ll x;
  mint(ll x_ = 0) : x((x_ % mod + mod) % mod) {}
  mint operator-() const { return mint(-x); }
  mint &operator+=(const mint &a) { if ((x += a.x) >= mod) x -= mod; return *this; }
  mint &operator-=(const mint &a) { if ((x += mod - a.x) >= mod) x -= mod; return *this; }
  mint &operator*=(const mint &a) { (x *= a.x) %= mod; return *this; }
  mint operator+(const mint &a) const { mint res(*this); return res += a; }
  mint operator-(const mint &a) const { mint res(*this); return res -= a; }
  mint operator*(const mint &a) const { mint res(*this); return res *= a; }
  mint pow(ll t) const { if (!t) return 1; mint a = pow(t >> 1); a *= a; if (t & 1) a *= *this; return a; }
  mint inv() const { return pow(mod - 2); }
  mint &operator/=(const mint &a) { return (*this) *= a.inv(); }
  mint operator/(const mint &a) const { mint res(*this); return res /= a; }
  friend ostream &operator<<(ostream &os, const mint &m) { os << m.x; return os; }
  friend istream &operator>>(istream &is, mint &m) { is >> m.x; return is; }
};

template<typename T>
struct PrefixSum {
  vector<T> sums;
  PrefixSum(vector<T> vs) {
    int n = (int)vs.size();
    sums.resize(n + 1, (T)0);
    for (int i : range(n)) sums[i + 1] = sums[i] ^ vs[i];
  }

  T sum(int i, int j) {
    // vs[i] + ... + vs[j]
    if (i > j) return (T)0;
    return sums[j + 1] ^ sums[i];
  }
};

ll brute(int n, vector<int> vs) {
  vector<mint> dp(n + 1);
  /*
  dp[n] = 1;
  for (int k = n - 1; k >= 0; --k) {
    for (int p = k + 1; p <= n; ++p) {
      int tot = 0;
      for (int r = p - 1; r > k; --r) {
        tot ^= vs[r];
        if (tot == 0) goto SKIP;
      }
      dp[k] += dp[p];
SKIP:;
    }
  }
  */
  for (int k = n - 1; k >= 0; --k) {
    dp[k] = 1;
    for (int p = k + 1; p < n; ++p) {
      int tot = 0;
      for (int r = p - 1; r > k; --r) {
        tot ^= vs[r];
        if (tot == 0) goto SKIP;
      }
      dp[k] += dp[p];
SKIP:;
    }
  }
  dump(dp);

  return dp[0].x;
}

ll solve() {
  int n; cin >> n;
  vector<int> vs(n);
  for (int i : range(n)) cin >> vs[i];

  dump(brute(n, vs));

  auto ps = PrefixSum(vs);
  map<int, int> mp;
  vector<int> nexts(n, -1);
  for (int i = n - 1; i >= 0; --i) {
    int sum = ps.sum(0, i);
    if (mp.count(sum)) {
      nexts[i] = mp[sum];
    }
    mp[sum] = i;
  }
  dump(nexts);

  vector<mint> dp(n);
  mint total = 0;
  for (int k = n - 1; k >= 0; --k) {
    dp[k] = 1;
    if (nexts[k] >= 0) total -= dp[nexts[k] + 1];
    dp[k] += total;
    total += dp[k];
  }
  dump(dp);

  return dp[0].x;
}

int main() {
  cout << fixed << setprecision(12);
  cout << solve() << endl;
}