MOD = 10**9 + 7

def calculate_partition_sum(n, a):
    xor_sum = [0] * (n + 1)
    dp = [0] * (n + 1)
    dp[0] = 1  # Base case: one way to partition an empty sequence
    
    for i in range(1, n + 1):
        xor_sum[i] = 0
        for j in range(i, 0, -1):
            xor_sum[j] ^= a[i - 1]
            dp[i] = (dp[i] + dp[j - 1] * xor_sum[j]) % MOD
    
    return dp[n]

# Read input
n = int(input().strip())
a = list(map(int, input().strip().split()))

# Calculate and print the result
result = calculate_partition_sum(n, a)
print(result)