n = int(input())
la = [0] + list(map(int, input().split()))
s = sum(la)
dp = [[0] * (s + 2) for i in range(n + 2)]
for i in range(n+1):
dp[i][0]=1
# dp[i][j]表示前i个能表示质量j
for i in range(1, n + 1): # 前i个砝码
for j in range(0, s + 1): # 能否表示质量j
if dp[i - 1][j] == 1:
dp[i][j] = 1
dp[i][j + la[i]] = 1
dp[i][abs(j - la[i])] = 1
print(sum(dp[n][1:s + 1]))#质量0不包括