#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
#define FOR(i,m,n) for(int i=(m);i<(n);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) (v).begin(),(v).end()
using ll = long long;
constexpr int INF = 0x3f3f3f3f;
constexpr long long LINF = 0x3f3f3f3f3f3f3f3fLL;
constexpr double EPS = 1e-8;
constexpr int MOD = 1000000007;
// constexpr int MOD = 998244353;
constexpr int DY[]{1, 0, -1, 0}, DX[]{0, -1, 0, 1};
constexpr int DY8[]{1, 1, 0, -1, -1, -1, 0, 1}, DX8[]{0, -1, -1, -1, 0, 1, 1, 1};
template <typename T, typename U> inline bool chmax(T& a, U b) { return a < b ? (a = b, true) : false; }
template <typename T, typename U> inline bool chmin(T& a, U b) { return a > b ? (a = b, true) : false; }
struct IOSetup {
  IOSetup() {
    std::cin.tie(nullptr);
    std::ios_base::sync_with_stdio(false);
    std::cout << fixed << setprecision(20);
  }
} iosetup;

int main() {
  int n; cin >> n;
  vector<int> a(n); REP(i, n) cin >> a[i];
  sort(ALL(a));
  const int m = a.back();
  ll ans = 0;
  vector dp(n + 1, vector(m * n + 1, 0LL));
  dp[0][0] = 1;
  for (int ai : a) {
    vector nxt(n + 1, vector(m * n + 1, 0LL));
    REP(i, n + 1) REP(j, m * n + 1) {
      if (i + 1 >= 2 && (j + ai) % i == 0 && ai <= (j + ai) / i) {
        ans += dp[i][j];
      }
      nxt[i][j] += dp[i][j];
      if (i + 1 <= n && j + ai <= m * n) nxt[i + 1][j + ai] += dp[i][j];
    }
    dp.swap(nxt);
  }
  cout << ans << '\n';
  return 0;
}