//In The Name Of ALLAH!
#pragma GCC optimize("O3")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
#define ll long long
#define ld long double
#define endl '\n'
#define pb push_back
#define pf push_front
#define speedyboy ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
#define bpc __builtin_popcount
#define all(x) x.begin() , x.end()
#define allr(x) x.rbegin() , x.rend()
#define F first
#define S second
#define pll pair<ll , ll>
#define turtle tuple<ll , ll , ll , ll>
#define pss pair<string , string>
#define YES cout << "YES" << endl;
#define NO cout << "NO" << endl;
#define ordered_set tree<ll , null_type , less<ll> , rb_tree_tag , tree_order_statistics_node_update>
const ll sz = 5e5 + 5 , INF = 1e18 , MOD = 998244353;
ll a[sz];
ll mask , i , j , o;
void solve(){
ll n , mx = 0;
cin >> n;
for(i = 0 ; i < n ; i++) cin >> a[i];
for(mask = 0 ; mask < (1 << n) ; mask++){
ll sum = 0;
vector<ll> v;
for(i = 0 ; i < n ; i++){
sum += a[i];
if(mask & (1 << i)){
v.pb(sum);
sum = 0;
}
}
if(is_sorted(all(v))){
mx = max(mx , (ll)v.size());
}
}
cout << mx << endl;
}
signed main(){
speedyboy;
//open;
ll t = 1;
//cin >> t;
while(t--){
solve();
}
}
