// yukicoder: 14 最小公倍数ソート
// 2021.8.14

#include <stdio.h>
#include <stdlib.h>

#define gc() getchar_unlocked()
#define pc(c) putchar_unlocked(c)

int in() {   // 非負整数の入力
	int n = 0, c = gc();
	do n = 10 * n + (c & 0xf), c = gc(); while (c >= '0');
	return n;
}

#define MAX 10000
#define CELL 16
int a[MAX+5], f[MAX+5]; int sz;
int *qi[MAX+5], hi[MAX+5], ti[MAX+5], mi[MAX+5];
int *qj[MAX+5], hj[MAX+5], mj[MAX+5];
int prev;

int cmp(const void *a, const void *b) {
	return *(int *)a - *(int *)b;
}

void out(int n, int sp) { // 非負整数の表示（出力）
	char b[20];
	prev = n, f[n]--; if (sp) pc(' '); 
	int i = 0; while (n) b[i++] = n % 10 + '0', n /= 10;
	while (i--) pc(b[i]);
}

void mktbl(int ma) {
	int i, j;
	for (i = 2; i <= ma; ++i) for (j = i; j <= ma; j += i) if (f[j]) {
		if (hi[i] >= mi[i]) {
			mi[i] += CELL, qi[i] = realloc(qi[i], sizeof(int)*mi[i]);
		}
		qi[i][hi[i]++] = j;
		if (hj[j] >= mj[j]) {
			mj[j] += CELL, qj[j] = realloc(qj[j], sizeof(int)*mj[j]);
		}
		qj[j][hj[j]++] = i;
	}
}

int gcd(int a, int b) {
	int r; while (b != 0) r = a % b, a = b, b = r;
	return a;
}
int lcm(int a, int b) { return a/gcd(a, b)*b; }

int next(int x) {
	int i, u, v, g, t;
	g = lcm(prev, x);
	for (i = 0; i < hj[prev]; ++i) {
		u = qj[prev][i];
		while (ti[u] < hi[u]) {
			v = qi[u][ti[u]];
			if (f[v]) break;
			ti[u]++;
		}
		if (ti[u] >= hi[u]) continue; 
		if ((t = lcm(prev, v)) < g ||
			(t == g && v < x)) g = t, x = v;
	}
	return x;
}

int main() {
	int i, k, N, one = 0;
	N = in();
	for (i = 0; i < N; i++) {
		k = in();
		if (i && k == 1) f[1]++, one++;
		else f[k]++, a[sz++] = k;
	}
	qsort(a+1, sz-1, sizeof(int), cmp);
	mktbl(a[sz-1]);
/*
for (i = 2; i < 20; ++i) {
	printf("(%d) sz=%d: ", i, hi[i]);
	for (k = 0; k < hi[i]; ++k) printf("%d ", qi[i][k]);
	printf("\n");
}
printf("\n");
for (i = 2; i < 20; ++i) {
	printf("(%d) sz=%d: ", i, hj[i]);
	for (k = 0; k < hj[i]; ++k) printf("%d ", qj[i][k]);
	printf("\n");
}
*/
	out(a[0], 0);
	while (one--) out(1, 1);
	i = 1; while (i < sz) {
		if (!f[a[i]]) ++i;
		else {
			k = next(a[i]);
			out(k, 1);
		}
	}
	pc('\n');
	return 0;
}