//*** Bismillah ***//
#pragma GCC optimize("O3", "fast-math", "unroll-loops", "no-stack-protector")
#include <bits/stdc++.h>
using namespace std;
#if !defined(ONLINE_JUDGE) and !defined(EVAL)
#include "template/debug.h"
#else
#define d(x...)
#endif
#define fr first
#define er erase
#define sc second
#define in insert
#define ll long long
#define pb push_back
#define vll vector<ll>
#define pll pair<ll,ll>
#define ull unsigned ll
#define vpll vector<pll>
#define len(x) (ll) x.size()
#define all(x) x.begin(),x.end()
const ll INF = 1e9;
const ll INFL = 1e18;
const ll MOD = 1e9+7;
// const ll MOD = 998244353;
const ll maxn = 2e5+5;
ll n,m,k=0;
ll a[maxn], ps[maxn];
void _(ll &tt){
cin >> n;
for(ll i = 1; i <= n; i ++){
cin >> a[i];
ps[i] = ps[i - 1] + a[i];
}
ll cv = 0;
for(ll i = 0; i < (1ll << n); i ++){
ll bf = 0, ind = 0, f = 1;
for(ll j = 0; j < n; j ++){
if((i & (1LL << j)) == 0) continue;
if(ps[j + 1] - ps[ind] >= bf){
bf = ps[j + 1] - ps[ind];
ind = j + 1;
}
else{
f = 0;
break;
}
}
if(f) cv = max(cv, (ll)__builtin_popcountll(i));
}
cout << cv << '\n';
}
signed main() {
ll tm = clock();
cin.tie(0)->sync_with_stdio(0);
ll t = 1;
// cin >> t;
for(ll tt = 1; tt <= t; tt ++) {
_(tt);
}
cerr << "\n\033[1;31mTime: \033[1;30m" \
<< (double)(clock()-tm)/1000000 << "\033[1;32m seconds\n";
}
