#include <bits/stdc++.h>
#define ll long long
#define ull unsigned long long
#define all(x) x.begin(), x.end()
#define Neco "Bigger segments"
#define resp(x) sort(all(x)), x.resize(unique(all(x)) - x.begin())
#define getbit(x,i) ((x >> i)&1)
#define _left id * 2, l, mid
#define _right id * 2 + 1, mid + 1, r
#define cntbit(x) __builtin_popcountll(x)
#define fi(i, a, b) for(int i = a; i <= b; i++)
#define fid(i, a, b) for(int i = a; i >= b; i--)
#define maxn (int) 5e5 + 7
using namespace std;
const ll mod = 1e9 + 7; //972663749
const ll base = 911382323;
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
ll GetRandom(ll l, ll r)
{
return uniform_int_distribution<ll> (l, r)(rng);
}
int n;
ll a[maxn], s[maxn];
pair<int, ll> dp[maxn];
pair<int, ll> bit[maxn];
void update(int x, pair<int, ll> val) {
while(x < maxn) bit[x] = max(bit[x], val), x += (x & -x);
}
pair<int, ll> get(int x, pair<int, ll> ans = {0, 0}) {
while(x > 0) ans = max(ans, bit[x]), x -= (x & -x);
return ans;
}
void solve()
{
cin >> n;
fi(i, 1, n) cin >> a[i], s[i] = s[i - 1] + a[i];
fi(i, 1, n) {
pair<int, ll> val = get(i);
dp[i] = {val.first + 1, s[i] - val.second};
int vt = lower_bound(s + 1, s + 1 + n, s[i] + dp[i].second) - s;
update(vt, {val.first + 1, s[i]});
}
cout << dp[n].first;
}
int main()
{
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
if(fopen(Neco".inp", "r")) {
freopen(Neco".inp", "r", stdin);
freopen(Neco".out", "w", stdout);
}
int nTest = 1;
// cin >> nTest;
while(nTest--)
{
solve();
}
return 0;
}
