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

using namespace std;

vector<int> q, v;
int n;

void read()
{
    ifstream fin ("economie.in");
    fin >> n;
    int x;
    for (unsigned i = 0; i < n; ++i)
        fin >> x,
        v.push_back(x);
    sort(v.begin(), v.end());
    fin.close();
}

void solve()
{
    for (unsigned i = 0; i < n ;++i)
        if (v[i] != -1){
            q.push_back(v[i]);
            for (unsigned j = i + 1; j < n; ++j)
                if (v[j] % v[i] == 0)
                    v[j] = -1;
        }
}

void write()
{
    ofstream fout ("economie.out");
    fout << q.size() << "\n";
    for (unsigned i = 0; i < q.size(); ++i)
        fout << q[i] << "\n";
    fout.close();
}

int main()
{
    read();
    solve();
    write();
    return 0;
}