#include <iostream>
#include <fstream>
#include <algorithm>
#define DN 1005
using namespace std;

int v[DN],r[DN];
bool viz[DN];

int main()
{
    int n;
    ifstream f("economie.in");
    ofstream g("economie.out");
    f>>n;
    for(int i=1;i<=n;++i)
        f>>v[i];
    sort(v+1,v+n+1);
    for(int i=1;i<=n;++i)
        if(viz[i]==0)
        {
            r[++r[0]]=v[i];
            for(int j=i+1;j<=n;++j)
                if(viz[j]==0 && !(v[j]%v[i]))
                    viz[j]=1;
        }
    g<<r[0]<<"\n";
    for(int i=1;i<=r[0];++i)
        g<<r[i]<<"\n";
    return 0;
}