#include <bits/stdc++.h>
using namespace std;
int main(){
  int N;
  cin >> N;
  vector<int> A(N);
  for (int i = 0; i < N; i++){
    cin >> A[i];
  }
  sort(A.begin(), A.end());
  int S = 0;
  vector<vector<long long>> dp(1, vector<long long>(1, 0));
  dp[0][0] = 1;
  long long ans = 0;
  for (int i = 0; i < N; i++){
    vector<vector<long long>> dp2(i + 2, vector<long long>(S + A[i] + 1, 0));
    for (int j = 0; j <= i; j++){
      for (int k = 0; k <= S; k++){
        dp2[j][k] += dp[j][k];
        dp2[j + 1][k + A[i]] += dp[j][k];
        int cnt = j + 1;
        int sum = k + A[i];
        if (cnt >= 2){
          if (sum % (cnt - 1) == 0){
            if (A[i] <= sum / (cnt - 1)){
              ans += dp[j][k];
            }
          }
        }
      }
    }
    swap(dp, dp2);
    S += A[i];
  }
  cout << ans << endl;
}