#include <bits/stdc++.h>
using namespace std;

#define int long long 
const int MOD = 1e9 + 7;
const int N = 3e5 + 10;

int n, a[N], pre[N];
int dp[N];

signed main()
{
//	freopen("divide.in", "r", stdin);
//	freopen("divide.out", "w", stdout);
	cin >> n;
	for (int i = 1; i <= n ;i ++ )
	{
		cin >> a[i];
		pre[i] = pre[i - 1] ^ a[i];
	}
	dp[0] = 1;
	for (int i = 1; i <= n; i ++ )
	{
		for (int j = 0; j < i; j ++ )
		{
			(dp[i] += (dp[j] % MOD) * ((pre[i] ^ pre[j]) % MOD) % MOD) %= MOD;
		}
	}
	cout << dp[n] % MOD << endl;
	return 0;
}