#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#define fst first
#define snd second
#define pb push_back
#define forn(i,a,b) for(int i = a; i<b; i++)
#define ALL(x) x.begin(),x.end()
#define SZ(x) (int)x.size()
#define mset(a,v) memset(a,v,sizeof(a))
using namespace std;
using namespace __gnu_pbds;
typedef long long ll;
template <typename T>
using iset = tree<T,null_type,less<T>,rb_tree_tag,tree_order_statistics_node_update>;
#ifdef D
#define debug(x) cout<<x
#else
#define debug(x) //nothing
#endif
const int MAXN = 25;
ll n;
ll v[MAXN];
ll ps[MAXN];
ll dp[MAXN][MAXN][MAXN];
ll f(ll i, ll j, ll k){
ll &res = dp[i][j][k];
if(res!=-1) return res;
res=0;
ll act = ps[i]-ps[j];
ll ant = ps[j]-(k-1>=0?ps[k-1]:0);
if(i==n){
if(act>=ant) return 1;
else return -1000000000;
}
//if(act>=ant) res=max(res,f(i+1,i,(j+1==i?j:j+1))+1);
if(act>=ant) res=max(res,f(i+1,i,j+1)+1);
res=max(res,f(i+1,j,k));
//cout<<i<<" "<<j<<" "<<k<<" = "<<res<<'\n';
return res;
}
int main(){
cin>>n;
forn(i,1,n+1) cin>>v[i], ps[i]=v[i];
ps[0]=0;
forn(i,2,n+1) ps[i]+=ps[i-1];
debug("mset\n");
mset(dp,-1);
debug("hora de la dp\n");
cout<<f(1,0,0)<<'\n';
return 0;
}
