#include <bits/stdc++.h>
using namespace std;
#define int long long
#define ff first
#define ss second
const int inf = 1e18;
signed main() {
int n;
cin >> n;
vector<int> a(n + 1);
for(int i = 1; i <= n; i++) cin >> a[i];
vector<pair<int, int>> dp(n + 1, {0, inf});
vector<int> p(n + 1, 0);
for(int i = 1; i <= n; i++) {
p[i] = p[i - 1] + a[i];
}
dp[0] = {0, 0};
for(int i = 1; i <= n; i++) {
// int l = 0, r = i - 1, mid, ans;
// while(l <= r) {
// mid = (l + r) / 2;
// int sum = p[i] - p[mid];
// if(dp[mid].ss <= sum) {
// ans = mid;
// l = mid + 1;
// } else r = mid - 1;
// }
// dp[i] = {dp[ans].ff + 1, p[i] - p[ans]};
for(int j = i - 1; j >= 0; j--) {
int sum = p[i] - p[j];
if(sum >= dp[j].ss) {
dp[i] = {dp[j].ff + 1, sum};
break;
}
}
}
cout << dp[n].ff << "\n";
return 0;
}
