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

using ll = long long;

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    int n;
    cin >> n;

    vector<ll> arr(n + 1);
    for (int i = 1; i <= n; ++i) {
        cin >> arr[i];
    }

    const ll INF = (ll)4e18;
    const int MAX_SUM = 100;

    vector<vector<ll>> dp(n + 1, vector<ll>(MAX_SUM + 1, INF));

    dp[0][0] = 0;

    for (int right = 1; right <= n; ++right) {
        ll segmentSum = 0;

        for (int left = right; left >= 1; --left) {
            segmentSum += arr[left];

            int len = right - left;

            for (int prevSum = 0; prevSum <= segmentSum; ++prevSum) {
                if (dp[left - 1][prevSum] == INF)
                    continue;

                dp[right][segmentSum] =
                    min(dp[right][segmentSum],
                        dp[left - 1][prevSum] + len);
            }
        }
    }

    ll result = INF;

    for (int s = 1; s <= MAX_SUM; ++s) {
        result = min(result, dp[n][s]);
    }

    cout << result << '\n';

    return 0;
}