n = int(input())
a = map(int, input().split())

lo = 6
hi = 30 - lo
s = 1 << lo
mask = (1 << lo) - 1

dp = [0] * s
for x in a:
    dp[x & mask] |= 1 << (x >> lo)

bit = 1
while bit < s:
    for i in range(0, s, bit << 1):
        for j in range(bit):
            dp[i + j] |= dp[i + bit + j]
    bit <<= 1

hs = 1 << hi
full = (1 << hs) - 1
f = []
for b in range(hi):
    bit = 1 << b
    f.append((full // ((1 << bit) + 1)) << bit)

ans = 0
for x in dp:
    for b in range(hi):
        x |= (x & f[b]) >> (1 << b)
    ans += x.bit_count()

print(ans)