from collections import defaultdict
N = int(input())
A = list(map(int, input().split()))

"""
* sum(X) は (M-1)の倍数
* 操作回数がsum(X)//(M-1)
* max(X)が操作回数以下であればいける

dp[i,j,k]: 要素数i, 合計がj, maxがk -> 何通り?
状態数少なそう
"""
dp = [defaultdict(int) for _ in range(N+1)]
dp[0][(0, 0)] = 1
for m, a in enumerate(A):
    for i in reversed(range(m+1)):
        for (j, k), v in dp[i].items():
            dp[i+1][(j+a, max(k, a))] += v

ans = 0
for i in range(2, N+1):
    for (sum, max), v in dp[i].items():
        if sum % (i - 1) != 0:
            continue
        if max <= sum // (i - 1):
            ans += v
print(ans)