#include <iostream>
#include <assert.h>
#include <algorithm>
#include <vector>
#define forn(i,n) for(int i=0;i<(int)n;++i)
#define forit(i,a,n) for(int i=a;i<=(int)n;++i)
#define DBG(a) cerr<<#a<<" = "<<(a)<<endl
#define DBGA(a) cerr<<#a<<" = "<<(a)<<", ";
#define DBG2(a,b) do{DBGA(a)DBG(b);}while(0)
#define ALL(v) v.begin(),v.end()
#define SZ(v) (int)v.size()
using namespace std;
template<typename T>
ostream &operator<<(ostream &os, vector<T> v){
os<<"[";
forn(i,SZ(v)){
if(i) os<<", ";
os<<v[i];
}
os<<"]";
return os;
}
typedef long long ll;
const ll INF = 1000000000000000000;
void solve(){
int n;
cin>>n;
vector<int> a(n);
for(int &x: a) cin>>x;
vector<ll> add(n+1);
forn(i,n) add[i+1] = add[i]+a[i];
vector<vector<ll>> dp(n+1,vector<ll>(n+1,INF));
forit(i,1,n) dp[1][i] = add[i]; // tablita aditiva fachera
forit(i,2,n){
int k = 0;
for(k=0;k<=n&&dp[i-1][k]==INF;++k); // el primero no INF
if(k > n) break; // todo es inf así que no se puede continuar
for(int j=k;j<=n;++j){
while(k<j && add[j]-add[k] >= dp[i-1][k]) ++k;
if(dp[i-1][k-1] != INF){
dp[i][j] = add[j]-add[k-1];
}
}
}
int ans = 0;
forit(i,1,n) if(dp[i][n] != INF) ans = i;
assert(ans != n);
cout<<ans<<"\n";
}
int main(){
ios_base::sync_with_stdio(0);
cin.tie(0);
#ifdef LOCAL
freopen("D.in", "r", stdin);
int tcs; cin>>tcs;
while(tcs--)
#endif
solve();
return 0;
}
