#include <bits/stdc++.h>
#define int long long
#define pb push_back
#define repp(i,x,n) for(int i=x;i<=n;i++)
#define repo(i,x,n) for(int i=x;i>=n;i--)
#define cy cout<<"Yes"<<endl
#define cn cout<<"No"<<endl
#define r0 return 0
#define fi first
#define se second
#define liow ios_base::sync_with_stdio(false);cin.tie(NULL)
#define jelek cout<<"jelek"<<endl
#define pii pair<int,int>
#define all(v) v.begin(),v.end()
#define pi pair<pair<int,int>,pair<int,int>>
#define fl fflush(stdout)
using namespace std;
const int mod=1e9+7,maxn=1e6+5,N=(1<<17),INF=1e18;
void solve(){
int n;cin>>n;
vector<int> pref(n+2);
pref[0]=0;
repp(i,1,n){
int x;cin>>x;
pref[i]=pref[i-1]+x;
}
vector<int>dp(n+2),pos(n+2);
repp(i,1,n){
pos[i]=max(pos[i],pos[i-1]);
dp[i]=dp[pos[i]]+1;
int nx=lower_bound(pref.begin()+1,pref.begin()+n+1,2*pref[i]-pref[pos[i]])-pref.begin();
pos[nx]=i;
}
cout<<dp[n];
}
signed main() {
liow;
int t=1;
// cin>>t;
while(t--){
solve();
}
}
