#include <fstream>
#include <vector>
#include <algorithm>

using namespace std;

const int NMAX = 1010;
const int VALMAX = 50010;
int n;
int v[NMAX];
int ciur[VALMAX];
vector <int> a;

int main()
{
	ifstream fin("economie.in");
	ofstream fout("economie.out");
	fin >> n;
	for (int i = 1;i <= n;++i)
	{
		fin >> v[i];
		ciur[v[i]] = 2;
	}
	sort(v + 1, v + n + 1);
	for (int i = 1;i <= n;++i)
		if (ciur[v[i]] != 1)
		{
			if (ciur[v[i]] == 2)
				a.push_back(v[i]);
			for (int j = 2 * v[i];j < VALMAX;j += v[i])
				ciur[j] = 1;
		}
	fout << (int)a.size() << "\n";
	for (int i : a)
		fout << i << "\n";
	fin.close();
	fout.close();
	return 0;
}