import sys

# sys.setrecursionlimit(200005)
int1 = lambda x: int(x)-1
pDB = lambda *x: print(*x, end="\n", file=sys.stderr)
p2D = lambda x: print(*x, sep="\n", end="\n\n", file=sys.stderr)
def II(): return int(sys.stdin.readline())
def LI(): return list(map(int, sys.stdin.readline().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def LI1(): return list(map(int1, sys.stdin.readline().split()))
def LLI1(rows_number): return [LI1() for _ in range(rows_number)]
def SI(): return sys.stdin.readline().rstrip()
# dij = [(0, 1), (-1, 0), (0, -1), (1, 0)]
# dij = [(0, 1), (-1, 0), (0, -1), (1, 0), (1, 1), (1, -1), (-1, 1), (-1, -1)]
# inf = (1<<63)-1
inf = (1 << 32)-1
# md = 10**9+7
md = 998244353

# size,sum
# 5000*100*50
# 125000000

n = II()
aa = sorted(LI())
dp = [[0]*5001 for _ in range(n+1)]

ans = 0
for i, a in enumerate(aa):
    for m in range(i, 0, -1):
        for s in range(100*i+1):
            pre = dp[m][s]
            if pre == 0: continue
            if s+a >= a*m:
                dp[m+1][s+a] += pre
                if (s+a)%m == 0: ans += pre
    dp[1][a] += 1
# p2D(dp)

print(ans)