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

int main(){
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    
    int n;
    cin>>n;
    int sum = 0;
    vector<vector<vector<ll>>> dp(1,vector<vector<ll>>(sum+1,vector<ll>(101,0)));
    dp[0][0][0] = 1;
    for(int i = 0;i<n;i++){
        int a;
        cin>>a;
        sum += a;
        vector<vector<vector<ll>>> ndp(i+2,vector<vector<ll>>(sum+1,vector<ll>(101,0)));

        for(int j = 0;j<=i;j++){
            for(int k = 0;k<=sum-a;k++){
                for(int l = 0;l<=100;l++){
                    int nl = max(l,a);
                    ndp[j][k][l] += dp[j][k][l];
                    ndp[j+1][k+a][nl] += dp[j][k][l];
                }
            }
        }
        swap(ndp,dp);
    }
    ll ans = 0;
    for(int i = 2;i<=n;i++){
        for(int j = 0;j<=sum;j++){
            for(int k = 0;k<=100;k++){
                if(j%(i-1)!=0) continue;
                int ni = j / (i-1);
                if(k-ni>0) continue;
                ans += dp[i][j][k];
            }
        }
    }

    cout<<ans<<endl;
}