from sys import stdin
n, *b = map(int, stdin.read().split())
maxa = max(b)
a = []
val = 0
for i in range(n):
    if b[i] != 0:
        a.append(b[i])
    else:
        val += 1

n = len(a)
ans = (1<<val) - val - 1

appear = [0 for i in range(maxa+1)]
for i in range(n):
    appear[a[i]] += 1

for i in range(maxa+1):
    ans += val * (1 << appear[i]) - val

for x in range(1,maxa*2+1):
    dp = [[0 for i in range(x+1)] for j in range(n+1)]
    dp[0][0] = 1
    for i in range(n):
        for j in range(x+1):
            if (a[i] <= x) & (x - a[i] <= j):
                dp[i+1][j] = dp[i][j] + dp[i][j-(x-a[i])]
            else:
                dp[i+1][j] = dp[i][j]
    ans += dp[n][x]

print("{}".format(ans))