#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;
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
template<typename T>
using indexed_set=tree<T,null_type,less<T>,rb_tree_tag,tree_order_statistics_node_update>;
int ans=0;
V<ll>ret;
void f(V<ll>a){
bool crc=1;
L(i,1,sz(a)-1)if(a[i-1]>a[i])crc=0;
if(crc){
if(ans<sz(a)){
ans=sz(a);
ret=a;
}
}
L(i,1,sz(a)-1){
if(a[i-1]>=a[i]){
V<ll>b=a;
int v=a[i];
b.erase(begin(b)+i);
b[i-1]+=v;
f(b);
}
}
}
int main(){
int n;cin>>n;
V<ll>v(n);
L(i,0,n-1)cin>>v[i];
f(v);
cout<<ans<<endl;
L(i,0,sz(ret)-1)cout<<ret[i]<<" ";
cout<<endl;
}
