#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define all(x) (x).begin(), (x).end()
#define sz(x) (int)(x).size()
#define pb push_back
#define ff first
#define sc second
#define int ll
signed main() {
#ifdef LOCAL
freopen("in.txt", "r", stdin);
freopen("out.txt", "w", stdout);
#endif
int n; cin >> n;
vector<int> a(n);
for (int i = 0; i < n; i++) cin >> a[i];
vector<int> pref(n + 1, 0);
for (int i = 1; i <= n; i++) pref[i] = pref[i - 1] + a[i - 1];
vector<vector<int>> dp(n + 1, vector<int>(n + 1, -1e9));
dp[0][0] = 0;
for (int i = 1; i <= n; i++) {
for (int len = 1; len <= i; len++) {
int cs = pref[i] - pref[i - len];
for (int len2 = 0; len2 <= i - len; len2++) {
if (cs >= pref[i - len] - pref[i - len - len2]) dp[i][len] = max(dp[i][len], 1 + dp[i - len][len2]);
}
//cout << i << ' ' << len << ' ' << dp[i][len] << '\n';
}
}
int mx = 0;
for (int i = 0; i <= n; i++) mx = max(mx, dp[n][i]);
cout << mx << '\n';
return 0;
}
