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

int i, n, nrez, x[1001], rez[1001];

int cbd(int x)
{
	for (int i = 1; i <= nrez; i ++)
		if (!(x % rez[i]))
			return 0;
	return 1;
}

int main()
{
	freopen ("economie.in", "rt", stdin);
	freopen ("economie.out", "wt", stdout);

	scanf("%ld", &n);
	for (i = 1; i <= n; i ++)
		scanf("%ld ", &x[i]);

	sort(x + 1, x + n + 1);

	for (i = 1; i <= n; i ++)
	{
		if (cbd(x[i]))
			rez[++ nrez] = x[i];
	}

	printf("%ld\n", nrez);
	for (i = 1; i <= nrez; i ++)
		printf("%ld\n", rez[i]);

	return 0;
}