#include <iostream>
#include <algorithm>
#include <map>
using namespace std;

const long long md = 1000000007;
int a[200009];
long long d[200009];
map<int, int> mp;

int main()
{
	ios::sync_with_stdio(false);
	cin.tie(0);
	int n; cin >> n;
	for (int i = 1; i <= n; i++) {
		cin >> a[i];
		a[i] ^= a[i - 1];
	}
	d[0] = 1;
	for (int i = 1; i < n; i++) {
		if (mp.find(a[i]) == mp.end())
			d[i] = (d[i - 1] * 2) % md;
		else
			d[i] = (d[i - 1] * 2 - d[mp[a[i]] - 1] + md) % md;
		mp[a[i]] = i;
	}
	cout << d[n - 1] << '\n';
	return 0;
}