#include <bits/stdc++.h>
using namespace std;
#define int long long
#define OYY LLONG_MAX
#define faster ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define fi first
#define se second
#define FOR for(int i=1;i<=n;i++)
#define mid (start+end)/2
#define pb push_back
#define lim 500005
const int mod=1000000007;
int n;
int dizi[lim],pre[lim];
int32_t main(){
faster
cin>>n;
FOR{
cin>>dizi[i];
pre[i]=pre[i-1]+dizi[i];
}
int eski=dizi[1],bas=2,cur=0;
int cev=1;
for(int i=2;i<=n;i++){
//cout<<cur<<" "<<eski<<" "<<cev<<" "<<bas<<endl;
if(cur+dizi[i]<eski){
cur+=dizi[i];
}
else{
cur+=dizi[i];
cev++;
while(cur-dizi[bas]>=eski){
cur-=dizi[bas];
bas++;
}
eski=cur;
cur=0;
bas=i+1;
}
}
cout<<cev<<'\n';
return 0;
}
