#include<cstdio>
#include<algorithm>
using namespace std;

int N, input[50001], i, j;
int solution[50001], k;

int main(){

    freopen("economie.in", "r", stdin);
    freopen("economie.out", "w", stdout);

    scanf("%d", &N);

    for(i = 1; i <= N; i++){
        scanf("%d", &input[i]);
    }

    sort(input + 1, input + N + 1);

    solution[++k] = input[1];

    for(i = 2; i <= N; i++){
        for(j = 1; j <= k; j++){
            if(input[i] % solution[j] == 0){
                break;
            }
        }
        if(j == k + 1){
            solution[++k] = input[i];
        }
    }

    printf("%d\n", k);

    for(i = 1; i <= k; i++){
        printf("%d ", solution[i]);
    }

    return 0;
}