N = int(input())
A = list(map(int,input().split()))
A.sort()

ans = 0
S = sum(A)
dp = [[0] * (N + 1) for _ in range(S + 1)]
dp[0][0] = 1
for _ in range(N):
    a = A[_]
    nx = [[0] * (N + 1) for _ in range(S + 1)]
    for s in range(S - a + 1):
        for k in range(N):
            nx[s + a][k + 1] += dp[s][k]
    for s in range(S + 1):
        for k in range(2,N + 1):
            if s % (k - 1) == 0:
                q = s // (k - 1)
                if a <= q:
                    ans += nx[s][k]
    for s in range(S + 1):
        for k in range(N + 1):
            nx[s][k] += dp[s][k]
    dp = nx
print(ans)