#include<bits/stdc++.h>
using namespace std;
#define ll long long
const int MAXN=5e5+6;
ll a[MAXN],n;
ll pref[MAXN];
int main()
{
cin>>n;
for(int i=1;i<=n;i++)cin>>a[i];
for(int i=1;i<=n;i++)
{
pref[i]=pref[i-1]+a[i];
}
ll last=0,l=1,cnt=1;
while(l!=n+1)
{
//cout<<l<<"\n";
int j=n;
for(int i=l;i<=n;i++)
{
if(pref[i]-pref[l-1]<last)continue;
//cout<<i<<" ";
int low=i+1,high=n-1,mid,ans=-1;
while(low<=high)
{
mid=(low+high)/2;
if(pref[mid]-pref[i]>=pref[i]-pref[l-1])
{
ans=mid;
high=mid-1;
}
else low=mid+1;
}
//cout<<ans<<endl;
if(ans==-1)continue;
//cout<<l<<" "<<ans<<endl;
if(pref[n]-pref[ans]<pref[ans]-pref[i])continue;
j=i;break;
}
cnt++;
last=pref[j]-pref[l-1];
l=j+1;
}
//cout<<endl;
cout<<max(1ll,cnt)<<endl;
return 0;
}
