#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);
vector<int> pos(n + 1, 0);
for(int i = 1; i <= n; i++) {
p[i] = p[i - 1] + a[i];
}
dp[0] = {0, 0};
int mx = 0;
for(int i = 1; i <= n; i++) {
mx = max(mx, pos[i]);
dp[i] = {dp[mx].ff + 1, p[i] - p[mx]};
int l = i + 1, r = n, mid, ans = -1;
while(l <= r) {
mid = l + (r - l) / 2;
if(p[mid] - p[i] >= dp[i].ss) {
ans = mid;
r = mid - 1;
} else l = mid + 1;
}
if(ans != -1) pos[ans] = i;
}
cout << dp[n].ff << "\n";
return 0;
}
