#include <stdio.h>
#include <stdlib.h>
int a[2001], n, v[6002], sol[2001], nr;

int cmp(const void *a, const void *b)
{
	return *(int*)a - *(int*)b;
}

int main()
{
	freopen("economie.in","r",stdin);
	freopen("economie.out","w",stdout);
	int i, j;
	scanf("%d",&n);
	for (i = 0; i < n; i++) scanf("%d",&a[i]);

	qsort(a, n, sizeof(int),cmp);

	sol[++nr] = a[0];
	for (i = 1; i < n; i++)
	{
		for (j = 1; j <= nr; j++)
			if (a[i] % sol[j] != 0)
			{
				sol[++nr] = a[i];
				break;
			}
	}

	printf("%d\n",nr);
	for (i = 1; i <= nr; i++) printf("%d\n",sol[i]);
	return 0;
}