#include<stdio.h>
#include<algorithm>
using namespace std;

int v[1002],sol[1002],f[50002];

int main()
{
    freopen("economie.in","r",stdin);
    freopen("economie.out","w",stdout);
    int n,i,j,k,x,s=0,max;
    scanf("%d",&n);
    for(i=1;i<=n;++i)
        scanf("%d",&v[i]);
    sort(v+1,v+1+n);
    max=v[n];
    for(i=1;i<=n;++i)
    {
        if(f[v[i]]==0)
        {
            sol[++s]=v[i];

            for(j=1;j<=max;++j)
            {
                if(f[j])
                    for(k=j+v[i];k<=max;k+=v[i])
                        f[k]=1;
            }
            for(k=v[i];k<=max;k+=v[i])
                f[k]=1;
        }
    }
    printf("%d\n",s);
    for(i=1;i<=s;++i)
        printf("%d\n",sol[i]);
    return 0;
}