void main() {
	const N = readInt;
	const M = 10000;
	auto ans = new int[N];
	ans[0] = readInt;
	auto cnt = new int[M + 1];
	foreach (i; 0 .. N - 1) {
		const a = readInt;
		cnt[a]++;
	}
	auto A = new int[M + 1];
	alias Entry = Tuple!(int, "x", int, "y");
	foreach (i; 0 .. N - 1) {
		int e = ans[i];
		Entry x = Entry(M * M, M);
		for (int j = 1; j * j <= e; ++j) if (e % j == 0) {
			foreach (k; [j, e / j]) {
				while (A[k] <= M && !cnt[A[k]]) A[k] += k;
				if (A[k] <= M) {
					chmin(x, Entry(A[k] / k, A[k]));
				}
			}
		}
		ans[i + 1] = x.y;
		cnt[x.y]--;
	}
	writefln("%(%s %)", ans);
}

import std,core.bitop;
string[]_R;
string readString(){while(_R.empty){_R=readln.chomp.split;}auto ret=_R.front;_R.popFront;return ret;}
int readInt(){return readString.to!int;}
long readLong(){return readString.to!long;}
ulong readULong(){return readString.to!ulong;}
real readReal(){return readString.to!real;}
bool chmin(T)(ref T A,T B){if(A>B){A=B;return true;}else{return false;}}
bool chmax(T)(ref T A,T B){if(A<B){A=B;return true;}else{return false;}}
int lowerBound(T)(T[]A,T x){int L=-1,R=cast(int)A.length;while(R-L>1){int mid=(L+R)/2;(A[mid]<x?L:R)=mid;}return R;}
int upperBound(T)(T[]A,T x){int L=-1,R=cast(int)A.length;while(R-L>1){int mid=(L+R)/2;(A[mid]<=x?L:R)=mid;}return R;}