#include <bits/stdc++.h>
#define F first
#define S second
#define int long long
using namespace std;
const int N = 5e5 + 5;
const long long M = (long long)1e15;
int n,a[N];
long long pref[N];
pair<long long,long long> dp[N];
//map< long long,pair<int,long long> > t;
struct tree{
tree *left,*right;
pair<long long,long long> mx;
tree(): left(NULL), right(NULL), mx(make_pair(0LL,0LL)) {}
};
tree *root = new tree();
pair<long long,long long> get_mx(tree *t){
return (t != NULL) ? (t->mx) : make_pair(0LL,0LL);
}
void upd(tree *t,long long tl,long long tr,long long pos,pair<long long,long long> val){
if(tl == tr){
t->mx = val;
return;
}
long long tm = (tl + tr) / 2;
if(pos <= tm){
if(t->left == NULL) t->left = new tree();
upd(t->left,tl,tm,pos,val);
}
else{
if(t->right == NULL) t->right = new tree();
upd(t->right,tm + 1,tr,pos,val);
}
t->mx = max(get_mx(t->left),get_mx(t->right));
}
pair<long long,long long> get(tree *t,int tl,int tr,int l,int r){
if(l <= tl && tr <= r) return t->mx;
if(l > tr || r < tl) return make_pair(0LL,0LL);
long long tm = (tl + tr) / 2;
pair<long long,long long> mx1 = (t->left != NULL) ? get(t->left,tl,tm,l,r) : make_pair(0LL,0LL);
pair<long long,long long> mx2 = (t->right != NULL) ? get(t->right,tm + 1,tr,l,r) : make_pair(0LL,0LL);
return max(mx1,mx2);
}
main(){
ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0);
cin >> n;
for(int i = 1; i <= n; i++){
cin >> a[i];
pref[i] = pref[i - 1] + a[i];
}
dp[1] = make_pair(1,a[1]);
upd(root,1,M,pref[1] + dp[1].S,make_pair(dp[1].F,1));
for(int i = 2; i <= n; i++){
dp[i] = make_pair(dp[i - 1].F,dp[i - 1].S + a[i]);
pair<long long,long long> cur = get(root,1,M,1,pref[i]);
if(cur.F > 0) dp[i] = make_pair(cur.F + 1,pref[i] - pref[cur.S]);
upd(root,1,M,pref[i] + dp[i].S,make_pair(dp[i].F,i));
}
cout << dp[n].F;
return 0;
}
