N = int(input())
A = list(map(int, input().split()))

# dp[i][j]:  i番目までの数字でjにできるかどうか
dp = [[False] * (25001) for _ in range(N + 1)]

dp[0][0] = True
for i in range(N):
    for j in range(25001):
        dp[i + 1][j] = dp[i][j]
        if j ^ A[i] < 25001:
            dp[i + 1][j] |= dp[i][j ^ A[i]]

print(sum(dp[N]))