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

#define NMAX 1005
#define LMAX 50005

using namespace std;

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

int n,v[NMAX];
bool prim[LMAX];
vector<int> sol;

int main()
{
	fin>>n;
	for(int i=1;i<=n;i++)
		fin>>v[i];
	sort(v+1,v+n+1);
	for(int i=1;i<=n;i++)
		if(!prim[v[i]])
		{
			for(int j=v[i];j<LMAX;j+=v[i])
				prim[j]=1;
			sol.push_back(v[i]);
		}
	fout<<sol.size()<<'\n';
	for(size_t i=0;i<sol.size();i++)
		fout<<sol[i]<<'\n';
	return 0;
}