#include <bits/stdc++.h>

using namespace std;

ifstream in("economie.in");
ofstream out("economie.out");

int n, a[1010], p, v;
multiset <int> h;

int main(){
	in >> n;
	for(int i = 1; i <= n; i++){
		in >> a[i];
		h.insert(a[i]);
	}
	sort(a + 1, a + n + 1);
	while(!h.empty()){
		++p;
		v = a[p];
		for(int i = v; i <= 50000; i += v)
			if(h.find(i) != h.end())
				h.erase(h.find(i));	
	}
	out << p << '\n';
	for(int i = 1; i <= p; i++)
		out << a[i] << '\n';
	return 0;
}