#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 main(){
int n;cin>>n;
V<ll>v(n);
L(i,0,n-1)cin>>v[i];
int ans=0;
V<ll>ret;
L(mask,0,(1<<n)-1)if(!(mask&(1<<0))){
V<ll>b;
L(i,0,n-1){
if(mask&(1<<i)){
ll a=b.back();
b.pop_back();
b.pb(a+v[i]);
}else b.pb(v[i]);
}
bool crc=1;
L(i,1,sz(b)-1)if(b[i-1]>b[i])crc=0;
if(crc){
if(ans<sz(b)){
ans=sz(b);
ret=b;
}
}
}
cout<<ans<<endl;
L(i,0,sz(ret)-1)cout<<ret[i]<<" ";
cout<<endl;
}
