//----------vahagng----------//
#define _CRT_SECURE_NO_WARNINGS
#include <bits/stdc++.h>
// #include <ext/pb_ds/assoc_container.hpp>
using namespace std;
// using namespace __gnu_pbds;
// template <class T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
#ifndef ONLINE_JUDGE
#define dbg(x) cerr << #x <<" "; print(x); cerr << endl;
#else
#define dbg(x)
#endif
void print(long long t) {cerr << t;}
void print(int t) {cerr << t;}
void print(string t) {cerr << t;}
void print(char t) {cerr << t;}
void print(double t) {cerr << t;}
void print(long double t) {cerr << t;}
void print(unsigned long long t) {cerr << t;}
template <class T, class V> void print(pair <T, V> p);
template <class T> void print(vector <T> v);
template <class T> void print(set <T> v);
template <class T, class V> void print(map <T, V> v);
template <class T> void print(multiset <T> v);
template <class T, class V> void print(T v[],V n) {cerr << "["; for(int i = 0; i < n; i++) {cerr << v[i] << " ";} cerr << "]";}
template <class T, class V> void print(pair <T, V> p) {cerr << "{"; print(p.first); cerr << ","; print(p.second); cerr << "}";}
template <class T> void print(vector <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]";}
template <class T> void print(set <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]";}
template <class T> void print(multiset <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]";}
template <class T, class V> void print(map <T, V> v) {cerr << "[ "; for (auto i : v) {print(i); cerr << " ";} cerr << "]";}
#define ll long long
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define ld long double
#define sz(v) v.size()
#define endl '\n'
const ll inf = 1e18, mod = 1e9+7, mod2=998244353;
void SetIO(string str = "") {
if (str != "") {
freopen((str + ".in").c_str(), "r", stdin);
freopen((str + ".out").c_str(), "w", stdout);
} else {
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
}
}
void FastIO(){
ios::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
}
const int N = 3e3+10;
ll n, dp[505][505], a[N], p[N];
ll rec(int i, ll pre, int cnt){
if(i == n+1) return cnt;
ll ans = 0;
ans = max(ans, rec(i+1, pre + a[i], cnt));
ll s1 = 0;
for(int j = i; j <= n; j++){
s1 += a[j];
if(s1 >= pre){
ans = max(ans, rec(j+1, s1, cnt + 1));
break;
}
}
return ans;
}
//dp[i][j] -> minimal sum of last segment with elements from i prefix and j segments
void solve(int tc){
cin >> n;
for(int i = 1; i <= n; i++) cin >> a[i];
for(int i = 1; i <= n; i++){
p[i] = p[i-1] + a[i];
}
// if(n <= 20){
// cout << rec(1, 0, 0) << endl;
// return;
// }
for(int i = 0; i <= n; i++){
for(int j = 0; j <= n; j++){
dp[i][j] = inf;
}
}
dp[0][0] = 0;
for(int i = 1; i <= n; i++){
for(int j = 1; j <= i; j++){
for(int k = 0;k < i; k++){
if(dp[k][j-1] <= p[i] - p[k]){
dp[i][j] = min(dp[i][j], p[i] - p[k]);
}
}
}
}
for(int j = n; j >= 1; j--){
if(dp[n][j] != inf){
cout << j << endl;
return;
}
}
}
void precalc(){
}
int main() {
// SetIO("moocast");
FastIO();
int test_case = 1;
// cin >> test_case;
precalc();
int cnt = 1;
while (test_case--){
solve(cnt++);
}
return 0;
}
