// Starcraft 2 enjoyer //
#include <bits/stdc++.h>
// #pragma GCC target("avx2")
// #pragma GCC optimize("O3")
// #pragma GCC optimize("unroll-loops")
using namespace std;
#define LSOne(X) ((X) & -(X))
const int N = 5e5 + 5;
const int M = 1e6 + 5;
const int K = 20;
const int LG = 20;
const long long INF = 1e18 + 5;
const int C = 26;
const int B = 1000;
const int MOD = 998244353;
int n, a[N], fi[N], la[N];
long long pref[N];
namespace subtask3
{
inline void solve()
{
pair<int, long long> dp[n + 1];
dp[0] = {0, 0};
for (int x = 0; x < n; x++)
{
auto [b, v] = dp[x];
for (int y = 1; y <= n; y++)
{
if (pref[y] - pref[x] >= -v)
{
dp[y] = max(dp[y], {b + 1, -(pref[y] - pref[x])});
}
}
}
cout << dp[n].first << "\n";
}
};
namespace subtask5
{
// binary search
inline void solve()
{
for (int x = 0; x <= n; x++)
{
fi[x] = 1e9;
}
pair<int, long long> dp[n + 1];
dp[0] = {0, 0};
fi[0] = 0;
la[0] = 0;
for (int x = 1; x <= n; x++)
{
int l = 0, r = dp[x - 1].first, ans = 0;
// cout << l << " " << r << " ";
while (l <= r)
{
int m = (l + r) / 2;
auto [num, val] = dp[fi[m]];
if (val <= pref[x] - pref[fi[m]])
{
ans = m;
l = m + 1;
}
else
{
r = m - 1;
}
}
dp[x].first = ans + 1;
// cout << ans << " ";
l = fi[ans], r = la[ans], ans = fi[ans];
while (l <= r)
{
int m = (l + r) / 2;
auto [num, val] = dp[m];
if (val <= pref[x] - pref[m])
{
dp[x].second = pref[x] - pref[m];
l = m + 1;
}
else
{
r = m - 1;
}
}
fi[dp[x].first] = min(fi[dp[x].first], x);
la[dp[x].first] = max(la[dp[x].first], x);
// cout << dp[x].first << " " << dp[x].second << "\n";
}
cout << dp[n].first << "\n";
}
};
inline void solve()
{
cin >> n;
pref[0] = 0;
for (int x = 1; x <= n; x++)
{
cin >> a[x];
pref[x] = pref[x - 1] + a[x];
}
subtask5::solve();
}
signed main()
{
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int t = 1;
// cin >> t;
for (int x = 1; x <= t; x++)
{
solve();
}
return 0;
}
