#include <stdio.h>

int n, m, a[1001];
int sol[1001], i, j, k;
int s[1001];

void Qsort(int st, int dr);

int main()
{
    freopen("economie.in", "r", stdin);
    freopen("economie.out", "w", stdout);
    scanf("%d", &n);
    for ( i = 1; i <= n; i++ )
        scanf("%d ", &a[i]);
    Qsort(1, n);
    k = 0;
    for ( i = 1; i <= n; i++ )
        if ( !s[i] )
        {
            k++, sol[k] = a[i];
            for ( j = i+1; j <= n; j++ )
                if ( a[j] % a[i] == 0 ) s[j] = 1;
        }
    printf("%d\n", k);
    for ( i = 1; i <= k; i++ )
        printf("%d\n", sol[i]);     
            
    
    
    return 0;
}

void Qsort(int st, int dr)
{
    int i = st-1;
    int j = dr+1;
    int mij = st;
    do
    {
        do { i++; } while ( a[i] <= a[mij] );
        do { j--; } while ( a[mij] <= a[j] );
        if ( i <= j )
        {
            k = a[i];
            a[i] = a[j];
            a[j] = k;
        }
    } while ( i <= j );
    if ( i < dr ) Qsort(i, dr);
    if ( st < j ) Qsort(st, j);
}