#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define pb emplace_back
#define AI(i) begin(i), end(i)
template<class T> bool chmin(T &a, T b) { return b < a && (a = b, true); }
template<class T> bool chmax(T &a, T b) { return a < b && (a = b, true); }
#ifdef KEV
#define DE(args...) kout("[ " + string(#args) + " ] = ", args)
void kout() { cerr << endl; }
template<class T, class ...U> void kout(T a, U ...b) { cerr << a << ' ', kout(b...); }
template<class T> void debug(T L, T R) { while (L != R) cerr << *L << " \n"[next(L) == R], ++L; }
#else
#define DE(...) 0
#define debug(...) 0
#endif
const int MAX_N = 3010, inf = 1e9;
int dp[MAX_N][MAX_N], n;
ll a[MAX_N], pf[MAX_N];
ll sum(int l, int r) { return pf[r] - pf[l-1] ; }
int32_t main() {
ios_base::sync_with_stdio(0), cin.tie(0);
cin >> n;
for (int i = 1;i <= n;++i)
cin >> a[i], pf[i] = pf[i-1] + a[i];
auto valid = [&](int l, int r, int i) {
return pf[i] - pf[r] >= pf[r] - pf[l-1];
};
int l = 1, r = 1, res = 1, k = 0;
for (int i = 2;i <= n;++i) {
if (valid(l, r, i)) {
++res;
while (r + 1 < i) {
if (!valid(l, r+1, i)) break;
++r;
if (k != 0) {
while (l < r) {
if (!valid(k, l, r)) break;
++l;
}
}
}
k = l;
l = r+1;
r = i;
}
}
cout << res << '\n';
}
