/*
ID: Sho10
LANG: C++
TASK:
*/
#include <bits/stdc++.h> //JuniorMonster a.k.a Sho10
#define ll long long int
#pragma GCC optimize("O3")
#pragma GCC optimize("Ofast")
#define all(a) (a).begin(), (a).end()
#define sz size
#define f first
#define s second
#define pb push_back
#define er erase
#define in insert
#define mp make_pair
#define pi pair
#define rc(s) return cout<<s,0
#define endl '\n'
#define mod 1000000007
#define PI 3.14159265359
#define CODE_START  ios_base::sync_with_stdio();cin.tie();cout.tie();
using namespace std;
ll n,a[1005],s1=0,s2=0;
vector<ll>v;
map<ll,ll>viz;
int32_t main(){
CODE_START;
ifstream cin("economie.in");
ofstream cout("economie.out");
cin>>n;
for(ll i=0;i<n;i++)
{
    cin>>a[i];
    if(a[i]%2==1){
        s1++;
    }else s2++;
}
sort(a,a+n);
for(ll i=0;i<n;i++)
if(a[i]%2==0){
    v.pb(a[i]);
    viz[a[i]]=1;
    break;
}
for(ll i=0;i<n;i++)
if(a[i]%2==1){
    v.pb(a[i]);
    viz[a[i]]=1;
    break;
}
sort(v.begin(),v.end());
for(ll i=0;i<n;i++)
if(viz[a[i]]==0){
    ll x,s1=0;
    while(x>=0){
        for(ll j=0;j<v.size();j++)
        {
            if(x%v[j]==0){
                s1=1;
                goto Next;
            }
        }
        for(ll j=v.size()-1;j>=0;j--){
            x=x-v[j];
            break;
    }
    }
    Next:if(s1==0){
        v.pb(a[i]);
    }
}
cout<<v.size()<<endl;
for(ll i=0;i<v.size();i++)
    cout<<v[i]<<endl;
}