N=int(input())
A=list(map(int,input().split()))
dp=[[[[0]*(sum(A)+1) for i in range(max(A)+1)] for k in range(N+1)] for s in range(N)]
dp[0][1][A[0]][A[0]]=1
dp[0][0][0][0]=1
mm=max(A)
ss=sum(A)
ans=0
for i in range(1,N):
  for j in range(N+1):
    for s in range(ss+1):
      if s>=A[i] and j>=1:
        for d in range(A[i]+1):
          dp[i][j][A[i]][s]+=dp[i-1][j-1][d][s-A[i]]
        for d in range(A[i]+1,mm+1):
          dp[i][j][d][s]+=dp[i-1][j-1][d][s-A[i]]
        
      for k in range(mm+1):
        dp[i][j][k][s]+=dp[i-1][j][k][s]
        
        if i==N-1 and j>=2:
          if (s%(j-1)==0 and k<=s//(j-1)):
            ans+=dp[i][j][k][s]
print(ans)