#include <cstdio>
#include <cstring>
#include <cassert>
#include <string>
#include <deque>
#include <vector>
#include <map>
#include <queue>
#include <algorithm>
#include <iostream>
#include <utility>
using namespace std;
using ll = long long;
using ld = long double;
#define ShinLena cin.tie(nullptr)->sync_with_stdio(false)
#define N 500005
#define ALL(x) x.begin(), x.end()
ll n, dp[N][2], fst[N];
ll a[N];
int main()
{
ShinLena;
cin >> n;
for (int i = 1; i <= n; ++i) cin >> a[i], a[i] += a[i-1];
dp[1][0] = 1; dp[1][1] = a[1];
fst[1] = 1;
for (int i = 2; i <= n; ++i)
{
ll w = dp[i-1][0];
ll l = fst[w], r = i - 1;
while (l <= r)
{
ll m = (l+r)/2;
if (dp[m][1] <= a[i] - a[m]) l = m + 1, dp[i][0] = w+1, dp[i][1] = a[i] - a[m];
else r = m - 1;
}
if (dp[i][0] < w + 1)
{
dp[i][0] = dp[i-1][0];
dp[i][1] = dp[i-1][1] + a[i];
}
if (!fst[dp[i][0]]) fst[dp[i][0]] = i;
}
cout << dp[n][0];
return 0;
}
