#include <iostream>
#include <fstream>
#include <algorithm>
using namespace std;
ifstream fin ("economie.in");
ofstream fout ("economie.out");
int v[1003],dp[50003],i,j,n,sol[1003],nr=0;
long long s=0;
int main()
{
    fin>>n;

    for(i=1;i<=n;i++)
        fin>>v[i],s+=v[i],dp[i]=-1;
          dp[0]=0;
    sort(v+1,v+n+1);

    for(i=1;i<=n;i++)
        if(dp[v[i]]==-1)
    {
        sol[++nr]=v[i];

        for(j=0;j<=s-v[i];j++)
            if(dp[j]!=-1)
                dp[j+v[i]]=1;
    }

    fout<<nr<<'\n';

    for(i=1;i<=nr;i++)
        fout<<sol[i]<<'\n';

    return 0;
}