#include <bits/stdc++.h>
#pragma GCC target("avx2")
#pragma GCC optimize("O3,unroll-loops")
using namespace std;
#define int long long
#define pii pair<int,int>
#define ff first
#define ss second
#define sp << " " <<
#define all(cont) cont.begin(),cont.end()
#define vi vector<int>
const int inf = 1e17,N = 2e6+1,MOD = (1LL<<61)-1,B = 23;
pii best(pii a,pii b) {
if (a.ff > b.ff) return a;
if (b.ff > a.ff) return b;
if (a.ss < b.ss) return a;
return b;
}
void solve() {
int n;
cin >> n;
vi a(n+1);
for (int i=1;i<=n;i++) cin >> a[i];
vi p(n+1,0);
for (int i=1;i<=n;i++) p[i] = p[i-1]+a[i];
vector<pii> dp(n+1,{-1,inf});
dp[0] = {0,0};
int ans = 0;
for (int i = 0;i<n;i++) {
if (i >= 1) dp[i] = best(dp[i],{dp[i-1].ff,dp[i-1].ss+a[i]});
int l = i+1;
int r = n;
while (l<=r) {
int m = (l+r) >> 1;
if (p[m]-p[i] >= dp[i].ss) r = m-1;
else l = m+1;
}
if (l <= n) dp[l] = best(dp[l],{dp[i].ff+1,p[l]-p[i]});
}
cout << dp[n].ff << '\n';
}
int32_t main() {
ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#ifdef Dodi
freopen("in.txt","r",stdin);
freopen("out.txt","w",stdout);
#endif
int t = 1;
//cin >> t;
while (t --> 0) solve();
}
