class SegmentTree:
    def __init__(self, init_val, segfunc, ide_ele):
        n = len(init_val)
        self.segfunc = segfunc
        self.ide_ele = ide_ele
        self.num = 1 << (n - 1).bit_length()
        self.tree = [ide_ele] * 2 * self.num
        self.size = n
        for i in range(n):
            self.tree[self.num + i] = init_val[i]
        for i in range(self.num - 1, 0, -1):
            self.tree[i] = self.segfunc(self.tree[2 * i], self.tree[2 * i + 1])

    def update(self, k, x):
        k += self.num
        self.tree[k] += x
        while k > 1:
            self.tree[k >> 1] = self.segfunc(self.tree[k], self.tree[k ^ 1])
            k >>= 1

    def query(self, l, r):
        if r==self.size:
            r = self.num

        res = self.ide_ele

        l += self.num
        r += self.num
        while l < r:
            if l & 1:
                res = self.segfunc(res, self.tree[l])
                l += 1
            if r & 1:
                res = self.segfunc(res, self.tree[r - 1])
            l >>= 1
            r >>= 1
        return res

import sys,random,bisect
from collections import deque,defaultdict
from heapq import heapify,heappop,heappush
from itertools import permutations
from math import gcd,log

input = lambda :sys.stdin.buffer.readline()
mi = lambda :map(int,input().split())
li = lambda :list(mi())

mod = 10**9 + 7

N = int(input())
A = li()

xor = [A[i] for i in range(N)]
for i in range(1,N):
    xor[i] ^= xor[i-1]

next_idx = [-1 for i in range(N+1)]
memo = {val:N for val in xor}
for i in range(N-1,-1,-1):
    val = xor[i]
    next_idx[i] = memo[val]
    memo[val] = i

dp = SegmentTree([0]*(N+1),lambda x,y:(x+y)%mod,0)
dp.update(0,1)
for i in range(1,N):
    pre_xor = xor[i-1]
    dp_val = dp.query(0,i+1)

    next = next_idx[i-1]
    dp.update(i,dp_val)
    if next+2<=N:
        dp.update(next+2,-dp_val)



print(dp.query(0,N+1))