#include<bits/stdc++.h>
using namespace std;

#define int long long
#define REP(i,m,n) for(int i=(m);i<(n);i++)
#define rep(i,n) REP(i,0,n)
#define pb push_back
#define all(a) a.begin(),a.end()
#define rall(c) (c).rbegin(),(c).rend()
#define mp make_pair
#define endl '\n'
//#define vec vector<ll>
//#define mat vector<vector<ll> >
#define fi first
#define se second
#define double long double
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll,ll> pll;
//typedef long double ld;
typedef complex<double> Complex;
const ll INF=1e9+7;
const ll MOD=998244353;
const ll inf=INF*INF;
const ll mod=2;
const ll MAX=1000010;
const double PI=acos(-1.0);
typedef vector<vector<ll> > mat;
typedef vector<ll> vec;



void solve(){
    ll n;cin>>n;
    vector<ll>a(n);
    ll sum=0;
    rep(i,n)cin>>a[i];
    rep(i,n)sum+=a[i];
    sort(all(a));
    vector<vector<ll> >  dp(n+1,vector<ll>  (sum+1));
    dp[0][0]=1;
    ll sum2=0;
    ll ans=0;
    rep(i,n){
        vector<vector<ll> > dp1(n+1,vector<ll> (sum+1));
        rep(l,n+1){
            rep(j,sum2+1){
                if(l<n){
                    dp1[l+1][j+a[i]]+=dp[l][j];
                    if(l>0&&(j+a[i])%l==0&&(j+a[i])/l>=a[i])ans+=dp[l][j];
                }
                dp1[l][j]+=dp[l][j];
            }
        }
        sum2+=a[i];
        swap(dp,dp1);
    }
    cout<<ans<<endl;
}

signed main(){
    //cin.tie(0);
    //ios::sync_with_stdio(false);
    solve();
}