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

struct iofast_t {
    iofast_t() {
        ios::sync_with_stdio(false);
        cin.tie(nullptr);
    }
} iofast;

struct uns_t {} uns;
template <typename Element, typename Head, typename ...Args>
auto vec(Element init, Head arg, Args ...args) {
    if constexpr (sizeof...(Args) == 0) return vector(arg, init);
    else return vector(arg, vec(init, args...));
}
template <typename Element, typename Head, typename ...Args>
auto vec(uns_t, Head arg, Args ...args) {
    return vec(Element(), arg, args...);
}

template <typename Container>
auto distance(const Container &c, decltype(begin(c)) iter) {
    return distance(begin(c), iter);
}

template <typename RIter, typename Compare = less<typename iterator_traits<RIter>::value_type>>
auto isort(RIter first, RIter last, Compare comp = Compare()) {
    vector<int> i(distance(first, last));
    iota(begin(i), end(i), 0);
    sort(begin(i), end(i), [&](auto x, auto y) {
        return comp(*(first + x), *(first + y));
    });
    return i;
}

template <typename, template <typename> typename, typename = void_t<>>
struct detect : false_type {};
template <typename T, template <typename> typename Check>
struct detect<T, Check, void_t<Check<T>>> : true_type {};
template <typename T, template <typename> typename Check>
constexpr inline bool detect_v = detect<T, Check>::value;

template <typename T>
using has_member_sort = decltype(declval<T>().sort());

template <typename Container, typename Compare = less<typename Container::value_type>>
auto sorted(Container c, Compare comp = Compare()) {
    if constexpr (detect_v<Container, has_member_sort>) {
        c.sort(comp);
        return c;
    }
    else {
        sort(begin(c), end(c), comp);
        return c;
    }
}

template <typename Container, typename Compare = equal_to<typename Container::value_type>>
auto uniqued(Container c, Compare comp = Compare()) {
    c.erase(unique(begin(c), end(c), comp), end(c));
    return c;
}

template <typename T, typename Compare = less<T>>
T &chmin(T &l, T r, Compare &&f = less<T>()) { return l = min(l, r, f); }
template <typename T, typename Compare = less<T>>
T &chmax(T &l, T r, Compare &&f = less<T>()) { return l = max(l, r, f); }

int main() {
    int n; cin >> n;
    auto a = vec<int>(uns, n);
    for (auto &e : a) cin >> e;
    sort(begin(a), end(a));
    auto s = accumulate(begin(a), end(a), 0);

    auto dp = vec<int64_t>(0, n + 1, n + 1, s + 1);

    dp[0][0][0] = 1;
    for (int i = 1; i <= n; ++i) {
        auto v = a[i - 1];
        for (int j = 0; j <= n; ++j) {
            for (int k = 0; k <= s; ++k) {
                dp[i][j][k] = dp[i - 1][j][k];
                if (0 <= j - 1 && 0 <= k - v) {
                    dp[i][j][k] += dp[i - 1][j - 1][k - v];
                }
            }
        }
    }

    int64_t ans = 0;

    int iter = 0;
    while (iter < n) {
        for (int i = 0; i <= iter; ++i) {
            for (int j = 0; j <= s; ++j) {
                if (2 <= i + 1 && i * a[iter] <= j + a[iter] && (j + a[iter]) % i == 0) {
                    ans += dp[iter][i][j];
                }
            }
        }

        ++iter;
    }

    cout << ans << endl;
}