#include "bits/stdc++.h"
using namespace std;
const int MAXN = 1e6 + 10;
const int MOD = 1e9 + 7;
#define int long long
mt19937_64 rng((int)std::chrono::steady_clock::now().time_since_epoch().count());
int rnd(int x, int y) {
int u = uniform_int_distribution<int>(x, y)(rng); return u;
}
long long bm(long long b, long long p) {
if(p==0) return 1;
long long r = bm(b, p/2);
if(p&1) return (((r*r) % MOD) * b) % MOD;
return (r*r) % MOD;
}
void solve(int tc) {
int n;
cin >> n;
int a[n+1];
for(int i=1; i<=n; i++)cin >> a[i];
int sum = 0;
int ans = 1;
for(int i=1; i<=n; i++) {
sum += a[i];
int cur = 0;
int pre = sum;
int wow = 1;
for(int j=i+1; j<=n; j++) {
if(cur + a[j] < pre) {
cur += a[j];
if(j == n) {
wow = -1e9;
}
}
else {
pre = cur + a[j];
cur = 0;
wow++;
}
}
ans = max(ans, wow);
}
cout << ans << '\n';
}
int32_t main(){
ios::sync_with_stdio(0); cin.tie(0);
int t = 1; //cin >> t;
for(int i=1; i<=t; i++) solve(i);
}
