#include "bits/stdc++.h"
#include "atcoder/all"
using namespace std;
using namespace atcoder;
using mint = modint1000000007;
const int mod = 1000000007;
//using mint = modint998244353;
//const int mod = 998244353;
//const int INF = 1e9;
//const long long LINF = 1e18;
const bool debug = false;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i,l,r)for(int i=(l);i<(r);++i)
#define rrep(i, n) for (int i = (n-1); i >= 0; --i)
#define rrep2(i,l,r)for(int i=(r-1);i>=(l);--i)
#define all(x) (x).begin(),(x).end()
#define allR(x) (x).rbegin(),(x).rend()
#define endl "\n"
#define P pair<int,int>
template<typename A, typename B> inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; }
mint dp[200005];
int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	int n; cin >> n;
	vector<long long>a(n);
	vector<long long>sum(n + 1);
	rep(i, n) {
		cin >> a[i];
		sum[i + 1] = sum[i] ^ a[i];
	}
	if (debug) {
		rep(i, n + 1)cout << sum[i] << " ";
		cout << endl;
	}
	map<int, int>mp;
	map<int, int>pre;
	rep(i, n + 1) {
		if (mp.count(sum[i])) pre[i] = mp[sum[i]];
		else pre[i] = -1;
		mp[sum[i]] = i;
	}
	dp[0] = 1;
	rep(i, n - 1) {
		if (-1 == pre[i + 1]) {
			rep(j, i + 1) {
				dp[i + 1] += dp[j];
			}
		}
		else {
			rep2(j, pre[i + 1], i + 1) {
				dp[i + 1] += dp[j];
			}
		}
	}
	if (debug) {
		rep(i, n + 1)cout << pre[i] << " ";
		cout << endl;
	}
	if (debug) {
		rep(i, n + 1)cout << dp[i].val() << " ";
		cout << endl;
	}
	mint ans = 0;
	rep(i, n) ans += dp[i];
	cout << ans.val() << endl;
	return 0;
}