#include <bits/stdc++.h>
//#include <atcoder/all>
using namespace std;
//using namespace atcoder;
//using mint = modint1000000007;
//const int mod = 1000000007;
//using mint = modint998244353;
//const int mod = 998244353;
//const int INF = 1e9;
//const long long LINF = 1e18;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i,l,r)for(int i=(l);i<(r);++i)
#define rrep(i, n) for (int i = (n-1); i >= 0; --i)
#define rrep2(i,l,r)for(int i=(r-1);i>=(l);--i)
#define all(x) (x).begin(),(x).end()
#define allR(x) (x).rbegin(),(x).rend()
#define endl "\n"
#define P pair<int,int>
template<typename A, typename B> inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; }
long long dp[101][51][5001];
int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	dp[0][0][0] = 1;// max,ele,sum;
	int n; cin >> n;
	rep(i, n) {
		int a; cin >> a;
		rrep(j, 101)rrep(k, 51)rrep(l, 5001) {
			if (0 == dp[j][k][l])continue;
			int nj = max(j, a);
			int nk = k + 1;
			int nl = l + a;
			dp[nj][nk][nl] += dp[j][k][l];
		}
	}
	long long sum = 0;
	rep(i, 101)rep(j, 51)rep(k, 5001) {
		//if (0 == dp[i][j][k]) continue;
		//cout << i << j << k << " " << dp[i][j][k] << endl;
		if (j < 2)continue;
		if (0 != k % (j - 1))continue;
		int ave = k / (j - 1);
		if (ave >= i)sum += dp[i][j][k];
	}
	cout << sum << endl;
	return 0;
}