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

using i64 = long long;

int main() {
    cin.tie(nullptr)->sync_with_stdio(false);

    int n;

    auto solve = [&]() {
        vector<int> a(n + 1);
        i64 tot = 0;
        for (int i = 1; i <= n; i++) {
            cin >> a[i];
            tot += 1LL * a[i] * i;
        }

        int L = 1;
        for (int i = 1; i <= n; i++) {
            L = lcm(L, i);
        }

        vector<int> dp((n + 1) * L);
        dp[0] = 1;

        for (int x = 1; x <= n; x++) {
            vector<int> ndp((n + 1) * L);
            for (int i = 0; i <= L; i++) {
                for (int j = 0; j <= a[x] && i + j * x <= (n + 1) * L; j++) {
                    ndp[i + j * x] |= dp[i];
                }
            }
            swap(dp, ndp);
        }

        i64 ans = 0;
        for (int i = 0; i < n * L && i <= tot; i++) {
            ans += dp[i];
        }
        for (int i = n * L; i < (n + 1) * L && i <= tot; i++) {
            if (dp[i]) {
                ans += (tot - n * L) / L + 1;
            }
        }

        cout << ans << '\n';
    };
    
    while (cin >> n) {
        solve();
    }
    
    return 0;
}