#include <bits/stdc++.h>
using namespace std;
#define TASK "long"
#define fi first
#define se second
#define ll long long
#define pb push_back
#define ALL(x) (x).begin(), (x).end()
#define GETBIT(mask, i) ((mask) >> (i) & 1)
#define MASK(i) ((1LL) << (i))
#define SZ(x) ((int)(x).size())
#define mp make_pair
#define CNTBIT(mask) __builtin_popcount(mask)
template<class X, class Y> bool maximize(X &x, Y y){ if (x < y) {x = y; return true;} return false;};
template<class X, class Y> bool minimize(X &x, Y y){ if (x > y) {x = y; return true;} return false;};
typedef pair<int, int> ii;
const int N = 5e5 + 5;
const long long INF = (long long)1e18 + 7;
const int mod = 1e9 + 7;
void add(int &x, int y) {x += y; if (x >= mod) x -= mod;}
void sub(int &x, int y) {x -= y; if (x < 0) x += mod;}
int mul(int x, int y) {return 1LL * x * y % mod;}
struct Fenwick {
int n;
vector<long long> v;
Fenwick(int _n = 0) {
n = _n;
v.assign(n + 2, INF);
}
void update(int x, long long c) {
for(; x > 0; x -= x & -x) v[x] = min(v[x], c);
}
long long get(int x) {
long long ans = INF;
for(; x <= n; x += x & -x) ans = min(ans, v[x]);
return ans;
}
} fw;
int n;
int a[N];
void read() {
cin >> n;
for(int i = 1; i <= n; i++) cin >> a[i];
}
void sub3() {
vector<vector<int>> dp;
vector<long long> pre;
dp.assign(n + 2, vector<int>(n + 2, -1));
pre.assign(n + 1, 0);
for(int i = 1; i <= n; i++) pre[i] = pre[i - 1] + a[i];
dp[0][0] = 0;
for(int i = 0; i < n; i++) {
for(int j = 0; j <= i; j++) if (dp[i][j] != -1) {
maximize(dp[i + 1][j], dp[i][j]);
long long s = pre[i] - pre[max(0, j - 1)];
// cerr << i << ' ' << j << ' ' << s << endl;
int p = lower_bound(ALL(pre), pre[i] + s) - pre.begin();
if (p == i) ++p;
// cerr << i << ' ' << j << ' ' << p << ' ' << pre[i] + s << endl;
maximize(dp[p][i + 1], dp[i][j] + 1);
}
}
int ans = 0;
for(int i = n; i >= 1; i--) ans = max(ans, dp[n][i]);
cout << ans;
}
void solve() {
// if (n <= 3000) {
// sub3();
// return;
// }
fw = Fenwick(n);
vector<int> dp(n + 1, 0);
vector<long long> d(n + 1, 0), pre(n + 1, 0);
for(int i = 1; i <= n; i++) pre[i] = pre[i - 1] + a[i];
fw.update(1, 2 * a[1]);
dp[1] = 1;
d[1] = a[1];
for(int i = 2; i <= n; i++) {
int l = 1, r = i - 1, pos = -1;
while(l <= r) {
int mid = (l + r) >> 1;
if (fw.get(mid) <= pre[i]) {
pos = mid;
l = mid + 1;
}
else r = mid - 1;
}
if (pos != -1) {
dp[i] = dp[pos] + 1;
d[i] = pre[i] - pre[pos];
}
else {
dp[i] = dp[i - 1];
d[i] = d[i - 1] + a[i];
}
fw.update(i, pre[i] + d[i]);
}
cout << dp[n];
}
signed main() {
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
if (fopen(TASK".inp", "r")) {
freopen(TASK".inp", "r", stdin);
freopen(TASK".out", "w", stdout);
}
int test = 1;
// cin >> test;
while(test--) {
read();
solve();
}
return 0;
}
