#include <cstdio>

#include <cstring>

#include <cmath>

#include <iostream>

#include <algorithm>

#include <queue>

#include <cstdlib>

#include <vector>

#include <set>

#include <map>

#define LL long long

#define mod 1000000007

#define inf 0x3f3f3f3f

#define N 10010

using namespace std;

int c1[N],c2[N],a[N],b[N];

int main()

{

    int n,sum;

    while(scanf("%d",&n)>)

    {

        sum=;

        for(int i=;i<=n;i++)

            scanf("%d",&a[i]),sum+=a[i];

        memset(c1,,sizeof(c1));

        memset(c2,,sizeof(c2));

        memset(b,,sizeof(b));

        for(int i=;i<=;i++)c1[a[]*i]=;

        for(int i=;i<=n;i++)

        {

            for(int j=;j<=sum;j++)

            {

                for(int k=;k<=&&k*a[i]+j<=sum;k++)

                    c2[j+k*a[i]]+=c1[j];

            }

            memcpy(c1,c2,sizeof(c1));

            memset(c2,,sizeof(c2));

        }

        for(int i=sum;i>;i--)

        {

            if(c1[i])

            for(int j=;j<i;j++)

            {

                if(c1[j])b[i-j]=;

            }

        }

        int num=;

        for(int i=;i<=sum;i++)

        {

            if(!c1[i]&&!b[i])c2[num++]=i;

        }

        printf("%d\n",num);

        if(num)

        {

            for(int i=;i<num-;i++)printf("%d ",c2[i]);

            printf("%d\n",c2[num-]);

        }

    }

}