from functools import reduce
from fractions import gcd
import math
import bisect
import itertools
import sys
sys.setrecursionlimit(10**7)
input = sys.stdin.readline
INF = float("inf")
MOD = 1000000007

# 処理内容
def main():
    N = int(input())
    A = list(map(int, input().split()))
    
    num = pow(2, 15)
    dp = [0] * num
    dp[0] = 1
    for i in range(N):
        for j in range(num):
            if dp[j] == 1:
                dp[j] = 1
                dp[j ^ A[i]] = 1
    
    print(sum(dp))


if __name__ == '__main__':
    main()