#include <stdio.h>

#define HASH 1000003
const int Mod = 1000000007, H_Mod = HASH;

typedef struct List {
	struct List *next;
	int v, last;
} list;

int main()
{
	int h, i, N, A, tmp = 0, sum[200001];
	list *hash[HASH] = {}, d[200001], *p;
	scanf("%d", &N);
	for (i = 1, sum[0] = 1; i <= N; i++) {
		scanf("%d", &A);
		tmp ^= A;
		h = tmp % H_Mod;
		for (p = hash[h]; p != NULL; p = p->next) if (p->v == tmp) break;
		if (p != NULL) {
			sum[i] = sum[i-1] * 2 - sum[p->last];
			if (sum[i] >= Mod) sum[i] -= Mod;
			else if (sum[i] < 0) sum[i] += Mod;
			p->last = i - 1;
		} else {
			sum[i] = sum[i-1] * 2;
			if (sum[i] >= Mod) sum[i] -= Mod;
			d[i].v = tmp;
			d[i].last = i - 1;
			d[i].next = hash[h];
			hash[h] = &(d[i]);
		}
	}
	printf("%lld\n", (sum[N] >= sum[N-1])? sum[N] - sum[N-1]: sum[N] - sum[N-1] + Mod);
	fflush(stdout);
	return 0;
}