n = int(input())
a = list(set(map(int, input().split())))
n = len(a)

# ver2 DP
dp = [[False]*(2**15) for i in range(n+1)]
dp[0][0] = True
for i in range(n):
    for k in range(2**15):
        #print(k,a[i],k^a[i])
        dp[i+1][k] = dp[i][k] or dp[i][k^a[i]]
        
print(sum(dp[-1]))