#include<cstdio>
#include<algorithm>
using namespace std;
int a[1001],r[50001],s[50001],i,j,k,n,l,c[1001];
int main()
{freopen("economie.in","r",stdin),freopen("economie.out","w",stdout);
scanf("%d",&n);
for(i=1;i<=n;i++)
      scanf("%d",&a[i]);
sort(a+1,a+n+1),s[a[1]]=a[1];
for(i=2;i<=n;i++)
      {for(j=1;j<=50000;j++)
             r[j]=s[j];
      if(r[a[i]]<a[i])
             s[a[i]]=a[i];
      for(j=1;j<=50000-a[i];j++)
      if(r[j+a[i]]<r[j]+a[i])
             s[j+a[i]]=r[j]+a[i];}
for(j=1,i=a[j];j<=n;i++)
if(s[i]==a[j])
      c[k++]=a[j++];
else
      if(s[i]!=a[j-1]&&s[i])
             break;
printf("%d\n",k);
for(i=0;i<k;i++)
      printf("%d\n",c[i]);
return 0;}