# Time Complexity: O((N + A) log A)

# Input
N = int(input())
A = list(map(int, input().split()))

# Pre-calculation
LIMIT = max(A)
cnt = [ 0 ] * (LIMIT + 1)
for x in A[1:]:
	cnt[x] += 1
vals = list(filter(lambda x: cnt[x] != 0, range(1, LIMIT + 1)))
divs = [ list() for i in range(LIMIT + 1) ]
for i in range(1, LIMIT + 1):
	for j in range(i, LIMIT + 1, i):
		divs[j].append(i)

# Calculation
used = [ True ] * (LIMIT + 1)
divpos = [ 0 ] * (LIMIT + 1)
preval = A[0]
result = [ A[0] ]
for x in vals:
	used[x] = False
for i in range(len(vals)):
	optval, optlcm = -1, 10 ** 18
	for j in divs[preval]:
		while divpos[j] <= LIMIT and used[divpos[j]]:
			divpos[j] += j
		if divpos[j] <= LIMIT and optlcm > preval * divpos[j] // j:
			optval = divpos[j]
			optlcm = preval * divpos[j] // j
	result += [ optval ] * cnt[optval]
	used[optval] = True
	preval = optval

# Output
print(*result)