#include <bits/stdc++.h>

using namespace std;

int const maxn = 50000;

int n;
int A[1005];
int p[maxn + 5];

int main()
{
    freopen("economie.in","r",stdin);
    freopen("economie.out","w",stdout);
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.tie(nullptr);
    cin >> n;
    for(int i = 1;i <= n; ++i){
        cin >> A[i];
    }
    sort(A + 1,A +1 + n);
    vector <int> ans;
    for(int i = 1;i <= n; ++i){
        if(!p[A[i]]){
            ans.push_back(A[i]);
            for(int j = 2 * A[i];j <= maxn; j += A[i])
                p[j] = 1;
        }
    }
    cout << ans.size() << "\n";
    for(auto x:ans)
        cout << x << "\n";
}