MOD = 10**9 + 7

def calculate_partition_sum(n, a):
    prefix_xor = 0
    dp = [0] * (n + 1)
    dp[0] = 1
    xor_count = {0: 1}  # 初始状态

    for i in range(1, n + 1):
        prefix_xor ^= a[i - 1]
        dp[i] = dp[i - 1]

        if prefix_xor in xor_count:
            dp[i] = (dp[i] + xor_count[prefix_xor]) % MOD

        xor_count[prefix_xor] = (xor_count.get(prefix_xor, 0) + dp[i - 1]) % MOD

    return dp[n]

# 读取输入
n = int(input().strip())
a = list(map(int, input().strip().split()))

# 计算并输出结果
result = calculate_partition_sum(n, a)
print(result)