#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define all(a) a.begin(),a.end()
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef unsigned long long ull;
typedef vector<int> vi;
const int mxn = 2e5+1;
ll pref[mxn];
void solve(){
int n; cin >> n;
for(int i = 1; i <= n; i++){
cin >> pref[i]; pref[i] += pref[i-1];
}
int ans = 0;
for(int i = 1; i <= n; i++){
int cnt = 1, last = i, last2 = 0;
for(int j = i+1; j <= n; j++){
if(pref[j]-pref[last] >= pref[last]-pref[last2]){
cnt++;
last2 = last;
last = j;
}
}
ans = max(ans,cnt);
}
cout << ans << '\n';
}
signed main(){
cin.tie(0)->sync_with_stdio(0);
int t = 1;
// cin >> t;
while(t--){solve();}
}
