#include <bits//stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
typedef tree<long long, null_type, less<long long>, rb_tree_tag,
tree_order_statistics_node_update>
ordered_set;
typedef tree<long long, null_type, less_equal<long long>, rb_tree_tag,
tree_order_statistics_node_update>
ordered_multiset;
#define ll long long
#define iloop(m, h) for (auto i = m; i != h; i += (m < h ? 1 : -1))
#define jloop(m, h) for (auto j = m; j != h; j += (m < h ? 1 : -1))
#define kloop(m, h) for (auto k = m; k != h; k += (m < h ? 1 : -1))
#define lloop(m, h) for (auto l = m; l != h; l += (m < h ? 1 : -1))
#define pll pair<ll, ll>
#define INF 1000000000000000
#define MOD1 1000000007
#define MOD2 998244353
#define MOD3 1000000009
ll n, a[500005], t1;
pll dp[500005];
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cin >> n;
iloop(0, n) {cin >> a[i]; if (i) a[i] += a[i-1];}
iloop(1, n+1) {
if (i == 1) dp[i] = {1, 0};
else dp[i] = max(dp[i], dp[i-1]);
t1 = lower_bound(a, a+n, 2*a[i-1] - dp[i].second) - a + 1;
dp[t1] = max(dp[t1], {dp[i].first + 1, a[i-1]});
//cout << dp[i].first << " " << dp[i].second << " " << t1 << endl;
}
cout << dp[n].first;
}
