n = int(input())
a = list(map(int, input().split()))
a.sort()
M = n * 100
dp = [[[0] * (M + 1) for _ in range(n + 1)] for _ in range(n + 1)]
dp[0][0][0] = 1
ans = 0
for i in range(n):
    for j in range(n + 1):
        for k in range(M + 1):
            if j < n and k + a[i] <= M:
                dp[i + 1][j + 1][k + a[i]] += dp[i][j][k]
                if j >= 1 and (k + a[i]) % j == 0 and a[i] <= (k + a[i]) // j:
                    ans += dp[i][j][k]
            dp[i + 1][j][k] += dp[i][j][k]
print(ans)