#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define sz(v) (int)(v).size()
#define all(v) (v).begin(), (v).end()
int main() {
ios::sync_with_stdio(false); cin.tie(nullptr);
int n;
cin >> n;
vector<int> a(n);
for (auto &i : a)
cin >> i;
vector<ll> p(n);
for (int i = 0; i < n; i++)
p[i] = (i ? p[i - 1] : 0) + a[i];
vector<ll> dp = p;
for (int i = 1; i < n; i++) {
vector<ll> u(n);
for (int j = n - 1; j >= 0; j--)
u[j] = min((j + 1 == n ? LLONG_MAX : u[j + 1]), dp[j] + p[j]);
for (int j = 0; j < n; j++) {
if (p[j] < u[0]) dp[j] = (ll)1e18;
else dp[j] = p[j] - p[upper_bound(u.begin(), u.begin() + j, p[j]) - u.begin() - 1];
}
if (dp[n - 1] == (ll)1e18) return cout << i, 0;
}
cout << n;
}
