#include<stdio.h>

int n,sol[50001],cnt=0; long v[1001],sol2[1001],i,j;

/*long divizare(int a,int x,long &m)
{long aux;   m=v[a];
 while(a<x)
 {while(v[a]<m) a++;
  while(v[x]>m) x--;
  if(a<x) {aux=v[a]; v[a]=v[x]; v[x]=aux;} }
  m=a;
}

long Q_SORT(int a,int x)
{long m;
if(a<x) {divizare(a,x,m);
	  Q_SORT(a,m-1);
	  Q_SORT(m+1,x);}
}*/

int sortare()
{long aux,ad=1;
while(ad==1)
{ad=0;
for(i=1;i<=n-1;i++)
if(v[i]>v[i+1]) {ad=1; aux=v[i]; v[i]=v[i+1]; v[i+1]=aux;}}
}


int update()
{long var=v[i];
for(j=var+1;j<=v[n];j++)
if(sol[j-var]==1 || j%var==0) sol[j]=1;}


int algoritm()
{for(i=1;i<=n;i++)
 if(sol[v[i]]==0) {cnt++; sol2[cnt]=v[i]; sol[v[i]]=1;
		   update();}
}


int main()
{freopen("economie.in","r",stdin);
 freopen("economie.out","w",stdout);

 scanf("%d",&n);
 for(i=1;i<=n;i++) scanf("%ld",&v[i]);
 //Q_SORT(1,n);
 sortare();

 algoritm();

 printf("%d\n",cnt);
 for(i=1;i<=cnt;i++) printf("%ld\n",sol2[i]);

 printf("\n"); }