import core.thread;
import std.conv, std.stdio, std.string;
import std.algorithm, std.array, std.bigint, std.container, std.math, std.range, std.regex;

//	Input
class EOFException : Throwable { this() { super("EOF"); } }
string[] tokens;
string readToken() { for (; tokens.empty; ) { tokens = readln.split; if (stdin.eof) throw new EOFException; } auto token = tokens[0]; tokens.popFront; return token; }
int readInt() { return to!int(readToken); }
long readLong() { return to!long(readToken); }
real readReal() { return to!real(readToken); }

//	chmin/chmax
void chmin(T)(ref T t, in T f) { if (t > f) t = f; }
void chmax(T)(ref T t, in T f) { if (t < f) t = f; }

//	Pair
struct Pair(S, T) {
	S x; T y;
	int opCmp(    const Pair p) const { return (x < p.x) ? -1 : (x > p.x) ? +1 : (y < p.y) ? -1 : (y > p.y) ? +1 : 0; }
	int opCmp(ref const Pair p) const { return (x < p.x) ? -1 : (x > p.x) ? +1 : (y < p.y) ? -1 : (y > p.y) ? +1 : 0; }
	string toString() const { return "(" ~ to!string(x) ~ ", " ~ to!string(y) ~ ")"; }
}
auto pair(S, T)(inout(S) x, inout(T) y) { return Pair!(S, T)(x, y); }

//	Array
int binarySearch(T)(in T[] as, in bool delegate(T) test) { int low = -1, upp = as.length; for (; low + 1 < upp; ) { int mid = (low + upp) >> 1; (test(as[mid]) ? low : upp) = mid; } return upp; }
int lowerBound(T)(in T[] as, in T val) { return as.binarySearch((T a) { return (a <  val); }); }
int upperBound(T)(in T[] as, in T val) { return as.binarySearch((T a) { return (a <= val); }); }
T[] unique(T)(in T[] as) { T[] bs; foreach (a; as) if (bs.empty || bs[$ - 1] != a) bs ~= a; return bs; }


immutable LIM = 10_005;

int N;
int[] A;

void main(string[] args) {
	try {
	for (; ; ) {
		N = readInt;
		A = new int[N];
		foreach (i; 0 .. N) {
			A[i] = readInt;
		}
		A[1 .. N].sort();
		
		auto ds = new int[][N];
		foreach (i; 0 .. N) {
			for (int d = 1; d * d <= A[i]; ++d) if (A[i] % d == 0) {
				ds[i] ~= d;
				if (d != A[i] / d) {
					ds[i] ~= A[i] / d;
				}
			}
		}
		auto qs = new int[][LIM];
		foreach (i; 1 .. N) {
			foreach (d; ds[i]) {
				qs[d] ~= i;
			}
		}
		
		int[] ans = new int[N];
		bool[] used = new bool[N];
		ans[0] = 0;
		used[0] = true;
		foreach (j; 0 .. N - 1) {
			auto mn = pair(int.max, int.max);
			int im = -1;
			foreach (d; ds[ans[j]]) {
				for (; !qs[d].empty && used[qs[d].front]; qs[d].popFront) {}
				if (!qs[d].empty) {
					const i = qs[d].front;
					if (mn > pair(A[i] / d, A[i])) {
						mn = pair(A[i] / d, A[i]);
						im = i;
					}
				}
			}
			assert(im != -1);
debug{
int gcd(int a,int b){return b?gcd(b,a%b):a;}
assert(mn==pair(A[im]/gcd(A[ans[j]],A[im]),A[im]));
}
			ans[j + 1] = im;
			used[im] = true;
		}
		writeln(ans.map!(i => A[i]).to!string.removechars("[],"));
		
	}
	} catch (EOFException) {}
}