//gm --- akezhon
#include <bits/stdc++.h>
// #pragma GCC optimize("Ofast,no-stack-protector,unroll-loops,fast-math,O3")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#define pb push_back
#define pf push_front
#define F first
#define S second
#define all(v) v.begin(),v.end()
#define pii pair<int,int>
#define tm (tl+tr)/2
#define TL v+v, tl, tm
#define TR v+v+1, tm+1, tr
#define DA l <= tl && tr <= r
#define NE r < tl || tr < l
#define double long double
#define int long long
using namespace std;
const int N=5e5+7;
const int mod=998244353;
const int inf=2e18;
int n, a[N];
int asd(int i, int sum){
int s=0;
for(; i <= n; i++){
s+=a[i];
if(sum <= s)return i;
}
return -1;
}
void AlemAmenov(){
cin >> n;
for(int i=1; i <= n; i++){
cin >> a[i];
}
int ans=0;
int sum=0;
int prev=1;
int pos=0;
while(1){
if(n <= pos)break;
while(sum < prev)sum+=a[++pos];
ans++;
int x = asd(pos+1, sum);
if(x==-1)break;
for(pos++; pos <= n; pos++){
sum+=a[pos];
if(x != asd(pos+1, sum)){
sum-=a[pos];
break;
}
}
pos--;
prev=sum;
sum=0;
}
cout << ans;
}
signed main(){
ios_base::sync_with_stdio(0);
cin.tie(0);
int RealName=1;
// cin >> RealName;
// srand(time(0));
while(RealName--)
AlemAmenov();
return 0;
}
