#include<bits/stdc++.h>
#define ll long long
#define pii pair<ll,ll>
using namespace std;
const int mxn=1e6+5;
const int inf=1e9;
pii dp[mxn];
ll a[mxn], pre[mxn];
int n;
struct segtree {
pii lazy[4 * mxn] = {};
pii tree[4 * mxn] = {};
void propogate(int node) {
int left=node<<1;
int right=left|1;
tree[left] = max(tree[left], lazy[node]);
tree[right] = max(tree[right], lazy[node]);
lazy[left] = max(lazy[left], lazy[node]);
lazy[right] = max(lazy[right], lazy[node]);
lazy[node] = {0, 0};
}
void update(int node,int b,int e,int l,int r,pii v) {
if(e<l || b>r)return;
if(b>=l && e<=r) {
tree[node] = max(tree[node], v);
lazy[node] = max(lazy[node], v);
return;
}
if(lazy[node]!= make_pair(0ll, 0ll)) propogate(node);
int mid=b+e>>1;
int left=node<<1;
int right=left|1;
update(left,b,mid,l,r,v);
update(right,mid+1,e,l,r,v);
tree[node]=max(tree[left],tree[right]);
}
pii query(int node, int b, int e, int p) {
if(b == e) return tree[node];
int mid = b + e >> 1;
int left = node << 1;
int right = left | 1;
if(lazy[node] != make_pair(0ll, 0ll)) propogate(node);
if(p <= mid) return query(left, b, mid, p);
return query(right, mid + 1, e, p);
}
} st;
int main() {
cin >> n;
pre[0] = 0;
for(int i = 1; i <= n; i++) {
cin >> a[i];
pre[i] = pre[i - 1] + a[i];
}
dp[0] = {0, 0};
for(int i = 1; i <= n; i++) {
dp[i] = {1, pre[i]};
auto x = st.query(1, 1, n, i);
dp[i] = max(dp[i], {x.first, pre[i] - x.second});
int lo = i + 1;
int hi = n;
int ind = n + 1;
while(lo <= hi) {
int mid = lo + hi >> 1;
if(pre[mid] >= dp[i].second + pre[i]) {
ind = mid;
hi = mid - 1;
} else {
lo = mid + 1;
}
}
st.update(1, 1, n, ind, n, make_pair(dp[i].first + 1ll, pre[i]));
}
cout<<dp[n].first<<endl;
}
