n = int(input())
*a, = map(int,input().split())
M = 1024
dp = [0]*(2*M)
dp[0] = 1
for ai in a:
    ndp = [0]*(2*M)
    for i in range(M):
        ndp[i+ai] |= dp[i]
        ndp[i&ai] |= dp[i]
    for i in range(M,2*M):
        if dp[i]:
            ndp[M+(i+ai)%M] += dp[i]
            ndp[i&ai] |= 1
    dp = ndp
    print(sum(dp))