#include <bits/stdc++.h>
#define V vector
#define L(i,j,k) for(int i=(j);i<=(k);i++)
#define R(i,j,k) for(int i=(j);i>=(k);i--)
#define all(x) x.begin(),x.end()
#define sz(a) ((int)a.size())
#define pb push_back
using namespace std;
typedef long long ll;
const int N=5000;
const ll INF=1e18;
ll dp[N][N],dp2[N][N],pf[N],an[N],st[N*4];
void chmin(ll &a,ll b){
a=min(a,b);
}
ll get(ll a,ll b){
if(a==0)return pf[b];
return pf[b]-pf[a-1];
}
int main(){
int n;cin>>n;
V<ll>v(n);
L(i,0,n-1){
cin>>v[i];
pf[i]+=v[i];
if(i)pf[i]+=pf[i-1];
}
if(n==1){
cout<<0<<endl;
cout<<v[0]<<endl;
return 0;
}
L(i,0,n-1)L(j,0,n-1)dp[i][j]=dp2[i][j]=INF;
dp[0][0]=dp2[0][0]=0;
L(i,1,n-1){
ll f=0;
R(j,i,0){
f+=v[j];
if(j==0){
chmin(dp[i][j],i-j);
}else{
int l=-1,r=j;
while(r-l>1){
int m=(r+l)/2;
if(get(m,j-1)<=f){
r=m;
}else l=m;
}
chmin(dp[i][j],dp2[j-1][r]+(i-j));
//~ R(k,j-1,0){
//~ s+=v[k];
//~ if(f>=s){
//~ chmin(dp[i][j],dp[j-1][k]+(i-j));
//~ }else break;
//~ }
}
}
pair<ll,ll>mn={INF,INF};
R(j,i,0){
dp2[i][j]=dp[i][j];
if(j!=i)chmin(dp2[i][j],dp2[i][j+1]);
if(dp[i][j]<mn.first){
mn=min(mn,{dp[i][j],j});
}
}
an[i]=mn.second;
}
ll ans=INF;
L(i,0,n-1){
if(ans>=dp[n-1][i]){
ans=dp[n-1][i];
}
}
cout<<n-ans<<endl;
int cur=n-1;
V<ll>sq;
while(cur>=0){
sq.pb(get(an[cur],cur));
cur=an[cur]-1;
}
reverse(all(sq));
L(i,0,sz(sq)-1)cout<<sq[i]<<" ";
}
