#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#define _GLIBCXX_DEBUG
using namespace std;
using std::cout;
using std::cin;
using std::endl;
using ll=long long;
using ld=long double;
ll ILL=1167167167167167167;
const int INF=2100000000;
const ll mod=998244353;
#define rep(i,a) for (ll i=0;i<a;i++)
template<class T> using _pq = priority_queue<T, vector<T>, greater<T>>;
template<class T> ll LB(vector<T> &v,T a){return lower_bound(v.begin(),v.end(),a)-v.begin();}
template<class T> ll UB(vector<T> &v,T a){return upper_bound(v.begin(),v.end(),a)-v.begin();}
template<class T> bool chmin(T &a,const T &b){if(a>b){a=b;return 1;}else return 0;}
template<class T> bool chmax(T &a,const T &b){if(a<b){a=b;return 1;}else return 0;}
template<class T> void So(vector<T> &v) {sort(v.begin(),v.end());}
template<class T> void Sore(vector<T> &v) {sort(v.begin(),v.end(),[](T x,T y){return x>y;});}
void yneos(bool a){if(a) cout<<"Yes\n"; else cout<<"No\n";}



void solve();

//  rainy ~ 雨に打たれて ~
int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	
	int t=1;
	//cin>>t;
	rep(i,t) solve();
}

void solve(){
	int n;
	cin>>n;
	vector<int> p(n);
	rep(i,n) cin>>p[i];
	So(p);
	int M=5100;
	vector<vector<ll>> dp(M,vector<ll>(n+1));
	ll ans=0;
	dp[0][0]=1;
	rep(i,n){
		vector<vector<ll>> n_dp(M,vector<ll>(n+1));
		rep(j,M) rep(k,n){
			if(dp[j][k]==0) continue;
			n_dp[j][k]+=dp[j][k];
			if(j+p[i]>=M) continue;
			n_dp[j+p[i]][k+1]+=dp[j][k];
			int tmp=j+p[i];
			if(k!=0&&tmp%(k)==0&&tmp/k>=p[i]){
				ans+=dp[j][k];
			}
		}
		swap(dp,n_dp);
	}
	cout<<ans<<"\n";
}