#include<bits/stdc++.h>
#pragma optimize ("g",on)
#pragma GCC optimize ("inline")
#pragma GCC optimize ("Ofast")
#pragma GCC optimize ("unroll-loops")
#pragma GCC optimize ("03")
#pragma GCC target ("sse,sse2,sse3,ssse3,sse4,popcnt,abm,avx2,mmx,fma,avx,tune=native")
#pragma comment(linker, "/stack:200000000")
//01001101 01100001 01101011 01101000 01100001 01100111 01100001 01111001
using namespace std;
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define ll long long
#define pb push_back
#define sz(a) a.size()
#define nl '\n'
#define popb pop_back()
#define ld double
#define ull unsigned long long
#define ff first
#define ss second
#define fix fixed << setprecision
#define pii pair<int, int>
#define E exit (0)
#define int long long
const int inf = 1e17, N = 1e6 + 1, mod = 998244353;
vector<pii> dir = {{1, 0}, {0, 1}, {-1, 0}, {0, -1}};
pii dp[N], t[4 * N];
int l[N], r[N], cnt = 2;
void update(int u, int tl, int tr, int pos, int ans, int i) {
if (tl == tr) {
if (t[u].ff < ans) {
t[u] = {ans, i};
}else if (t[u].ff == ans && t[u].ss < i) t[u] = {ans, i};
return;
}
int mid = (tl + tr) / 2;
if (pos <= mid) {
if (!l[u]) l[u] = cnt++;
update(l[u], tl, mid, pos, ans, i);
}else {
if (!r[u]) r[u] = cnt++;
update(r[u], mid + 1, tr, pos, ans, i);
}
if (t[l[u]].ff < t[r[u]].ff) {
t[u] = t[r[u]];
}else if (t[r[u]].ff < t[l[u]].ff) {
t[u] = t[l[u]];
}else t[u] = {t[l[u]].ff, max(t[l[u]].ss, t[r[u]].ss)};
}
pii get(int u, int tl, int tr, int l1, int r1) {
if (tl > r1 || tr < l1) {
return {0, 0};
}
if (tl >= l1 && tr <= r1) {
return {t[u].ff, t[u].ss};
}
int mid = (tl + tr) / 2;
pii a = {0, 0}, b = {0, 0};
if (l[u]) a = get(l[u], tl, mid, l1, r1);
if (r[u]) b = get(r[u], mid + 1, tr, l1, r1);
if (a.ff > b.ff) return a;
if (b.ff > a.ff) return b;
return {a.ff, max(a.ss, b.ss)};
}
main() {
//freopen("cowrect.in", "r", stdin);
//freopen("cowrect.out", "w", stdout);
ios_base::sync_with_stdio(NULL);
cin.tie(NULL);
int n;
cin >> n;
int a[n + 1], pref[n + 1];
pref[0] = 0;
for (int i = 1; i <= n; i++) {
cin >> a[i];
pref[i] = pref[i - 1] + a[i];
}
for (int i = 1; i <= n; i++) {
dp[i] = get(1, 0, inf, 0, pref[i]);
dp[i].ff++;
dp[i].ss = pref[i] - pref[dp[i].ss];
update(1, 0, inf, dp[i].ss + pref[i], dp[i].ff, i);
}
cout << dp[n].ff;
}
