#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 I=1e18;
ll dp[N][N],pf[N];
pair<ll,ll>par[N][N];
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]=I;
dp[0][0]=0;
L(i,1,n-1){
ll f=0;
R(j,i,0){
f+=v[j];
if(j==0){
if(dp[i][j]>=i-j){
dp[i][j]=i-j;
}
}
else{
ll s=0;
R(k,j-1,0){
s+=v[k];
if(f>=s){
if(dp[i][j]>=dp[j-1][k]+(i-j)){
dp[i][j]=dp[j-1][k]+(i-j);
}
}
}
}
}
}
ll ans=I;
pair<ll,ll>coord;
L(i,0,n-1){
if(ans>=dp[n-1][i]){
ans=dp[n-1][i];
coord={n-1,i};
}
}
cout<<n-ans<<endl;
L(i,0,n-ans-1)cout<<1<<" ";
cout<<endl;
}
