# include <bits/stdc++.h>
# define pb push_back
# define ff first
# define ss second
# define nl "\n"
# define sz(x) ((int)(x).size())
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
const ll maxn = 2e5 + 25;
const ll inf = 1e18 + 0;
const ll mod = 1e9 + 7;
const ll dx[] = {-1, 1, 0, 0};
const ll dy[] = {0, 0, -1, 1};
using namespace std;
ll n, a[maxn], pref[maxn];
pair <ll, ll> dp[maxn];
void ma1n (/* SABR */)
{
cin >> n;
for (ll i = 1; i <= n; ++i)
{
cin >> a[i];
pref[i] = pref[i - 1] + a[i];
}
ll ans = 0;
for (ll i = 1; i <= n; ++i)
{
ll pos = -1, mx = 0;
for (ll j = 1; j < i; ++j)
{
if (dp[j].ff > mx && dp[j].ss <= pref[i] - pref[j])
{
mx = dp[j].ff;
pos = j;
}
else if (dp[j].ff == mx && dp[j].ss < pref[i] - pref[j])
{
pos = j;
}
}
if (pos != -1) dp[i].ff = dp[pos].ff + 1, dp[i].ss = pref[i] - pref[pos];
else
{
if (i == 1) dp[i].ff = 1;
dp[i].ff += dp[i - 1].ff;
dp[i].ss = dp[i - 1].ss + a[i];
}
ans = max(ans, dp[i].ff);
// cout << dp[i].ff << ' ' << dp[i].ss << ' ' << pos << endl;
}
cout << dp[n].ff << nl;
}
int main()
{
ios::sync_with_stdio(false);
cin.tie(0); cout.tie(0);
// freopen("file.in", "r", stdin);
// freopen("file.out", "w", stdout);
int ttt = 1;
// cin >> ttt;
for (int test = 1; test <= ttt; ++test)
{
// cout << "Case " << test << ":" << ' ';
ma1n();
}
return 0;
}
