#include<stdio.h>
#include<algorithm>
#define lg1 1005
#define lg2 50005

using namespace std;

int n, i, j, v[lg1], fst[lg2], sol[lg1];
int main()
{
	freopen("economie.in", "rt", stdin);
	freopen("economie.out", "wt", stdout);
	
	scanf("%d", &n);
	
	for (i = 1; i <= n; i ++)
		scanf("%d", &v[i]);
	
	sort(v+1, v+n+1);
	
	for (i = 1; i <= n; i ++)
		for (j = i+1; j <= n; j ++)
			if (v[j] % v[i] == 0 && !fst[v[j]]){
				fst[v[j]] = 1;
				sol[++sol[0]] = v[i];
			}
	
	printf("%d\n", sol[0]);
	for (i = 1; i <= sol[0]; i ++)
		printf("%d\n", sol[i]);
	
	fclose(stdin);
	fclose(stdout);
	return 0;
}