#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
using ll = long long;
#define all(x) x.begin(), x.end()
#define rep(i, n) for (ll i = 0; i < n; i++)
int main(void)
{
    ll n;
    cin >> n;
    vector<ll> a(n);
    rep(i, n) cin >> a[i];
    sort(all(a));
    vector<vector<vector<ll>>> dp(n + 1, vector<vector<ll>>(6000, vector<ll>(n + 1, 0)));
    dp[0][0][0] = 1;
    ll ans = 0;
    rep(i, n){
        rep(j, 5001){
            rep(k, n){
                dp[i + 1][j + a[i]][k + 1] += dp[i][j][k];
                dp[i + 1][j][k] += dp[i][j][k];
                if(k >= 1){
                    if(((j + a[i]) % k == 0) && (k * a[i] <= j + a[i])){
                        ans += dp[i][j][k];
                    }
                }
            }
        }
    }
    cout << ans << endl;

    return 0;
}