# No.183 たのしい排他的論理和(EASY)
# cf. AtCoder tdpcA - コンテスト
def main():
    _ = input()
    A = set(map(int, input().rstrip().split()))
    N = len(A)
    lim = 2 ** 15
    dp = [0] * (lim + 1)
    dp[0] = 1
    for i in A:
        for j in range(lim, -1, -1):
            if i == j:
                dp[i] = 1
            elif dp[j]:
                dp[i ^ j] = 1
    print(sum(dp))


if __name__ == "__main__":
    main()