#include <bits/stdc++.h>
#define all(x) (x).begin(), (x).end()
#define sz(x) (int) (x).size()
using namespace std;
typedef long long lint;
typedef pair<int,lint> ii;
int arr[500006];
struct node{
ii val = ii(0,0);
node *l = nullptr, *r = nullptr;
node(lint S, lint E){
val = ii(0,0);
}
void create(lint s, lint e){
lint m = (s + e)/2;
if(s == e) return;
l = new node(s, m);
r = new node(m+1, e);
}
void update(lint X, ii V, lint s, lint e){
lint m = (s+e)/2;
if(s == e) val = V;
else{
if(l == nullptr) create(s, e);
if(X <= m) l->update(X, V, s, m);
else r->update(X, V, m+1, e);
val = max(l->val, r->val);
}
}
ii query(lint S, lint E, lint s, lint e){
lint m = (s+e)/2;
if(S == s && e == E) return val;
else{
if(l == nullptr) create(s, e);
if(E <= m) return l->query(S, E, s, m);
else if(S >= m+1) return r->query(S, E, m+1, e);
else return max(l->query(S, m, s, m), r->query(m+1, E, m+1, e));
}
}
} *root = new node(0, 1e14);
int main(){
ios_base::sync_with_stdio(false); cin.tie(0);
int n; cin >> n;
for(int i = 1;i <= n;i++) cin >> arr[i];
lint prefix = 0;
root->update(0, ii(0,0), 0, 1e14);
lint prev = 0;
for(int i = 1;i <= n;i++){
prefix += arr[i];
ii res = root->query(0, prefix, 0, 1e14);
int most = res.first + 1;
lint take = prefix - res.second;
assert(take + prefix >= prev);
prev = take + prefix;
if(i == n) cout << most;
root->update(take + prefix, ii(most, prefix), 0, 1e14);
}
}
