#include <stdio.h>
#include <vector>
#include <algorithm>
using namespace std;

#define in "economie.in"
#define out "economie.out"
#define dim 1001

int N;
int A[dim];
vector<int> L;
vector<int>::iterator it;

int main()
{
    bool ok = 0;
    
    freopen(in,"r",stdin);
    freopen(out,"w",stdout);
    
    scanf("%d", &N);
    for ( int i = 1; i <= N; i++ ) scanf("%d", &A[i]);
    
    sort(A+1,A+N+1);
    
    L.push_back(1);
    for ( int i = 2; i <= N; i++ )
    {
        ok = 0;
        
        for ( it = L.begin(); it != L.end(); it++ )
            if ( A[i] % (*it) == 0 ) 
            {
                 ok = 1;
                 break;
            }
        
        if ( !ok ) L.push_back(A[i]);
    }
    
    printf("%d\n", L.size() );
    for ( it = L.begin(); it != L.end(); it++ )
        printf("%d\n", *it );
}