#include<stdio.h>
#include<algorithm>
using namespace std;
int i,n,v[1001],s[50001],aux,smax,j,sol[1001];
int main()
{
    freopen("economie.in","r",stdin);
    freopen("economie.out","w",stdout);
    scanf("%d",&n);
    for(i=1;i<=n;i++)
    scanf("%d",&v[i]);
    sort(v+1,v+n+1);
    for(i=v[1];i<=v[n];i+=v[1])
    s[i]=1;
    smax=aux=i-v[1];
    sol[++sol[0]]=v[1];
    for(i=2;i<=n;i++)
    {
        if(s[v[i]]==0)
        {
            sol[++sol[0]]=v[i];
            for(j=v[i];j<=v[n];j+=v[i])
            s[j]=1;if(j-v[i]>smax)smax=j-v[i];
            for(j=smax;j>0;j--)
            {
                if(s[j]!=0&&j+v[i]<=v[n])
                {
                s[j+v[i]]=1;
                if(j+v[i]>aux)
                aux=j+v[i];
                }
            }
        }
        if(aux>smax)smax=aux;
    }
    printf("%d\n",sol[0]);
    for(i=1;i<=sol[0];i++)
    printf("%d\n",sol[i]);
    return 0;
}