#include<bits/stdc++.h>
using namespace std;
#define f first
#define s second
#define int long long
const int maxn = 5010;
const int inf = 1e18;
int n, a[maxn], dp[maxn][maxn], p[maxn];
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int tt = 1;
//cin >> tt;
while (tt--) {
cin >> n;
for (int i = 1;i <= n;i++)
cin >> a[i];
for (int i = 1;i <= n;i++)
p[i] = p[i - 1] + a[i];
for (int i = 0;i <= n;i++) {
for (int j = 0;j <= n;j++)
dp[i][j] = inf;
}
dp[0][0] = 0;
for (int i = 1;i <= n;i++) {
for (int j = 1;j <= n;j++) {
for (int k = i - 1;k >= 0;k--) {
if (p[i] - p[k] >= dp[k][j - 1]) {
dp[i][j] = p[i] - p[k];
break;
}
}
}
}
// for (int i = 1;i <= n;i++) {
// for (int j = 1;j <= n;j++)
// cout << dp[i][j] << " ";
// cout << endl;
// }
int ans = 0;
for (int i = 1;i <= n;i++) {
if (dp[n][i] != inf)
ans = i;
}
cout << ans;
}
return 0;
}
