# <http://yukicoder.me/submissions/1252>をPythonに移植
# Pythonには慣れてないのでそのまま移植した感なコードになってるかと…
# ちなみに↑の"シンプルに…"のところは嘘だった。正しくはO(N X^\epsilon + X^{1+\epsilon})とかそんなん(まだ自信ない)
# ちなみに数xの約数の数は"最悪"O(x^\epsilon)で抑えられる。"divisor bound"と言うらしい。平均はΘ(log x)。

def getSmallestPrimeFactors(n):
	res = [0] * (n+1)
	res[1] = 1
	for i in xrange(2, n+1):
		if res[i] == 0:
			res[i] = i
			for j in xrange(i * i, n+1, i):
				if res[j] == 0:
					res[j] = i
	return res

def primeFactors(x, smallestPrimeFactor):
	res = []
	while x != 1:
		p, k = smallestPrimeFactor[x], 1
		x //= p
		while x % p == 0:
			x //= p
			k += 1
		res.append((p, k))
	return res

def getDivisors(x, smallestPrimeFactor):
	fs = primeFactors(x, smallestPrimeFactor)
	res = [1]
	for p, k in fs:
		for x in res[:]:
			for _ in xrange(k):
				x *= p
				res.append(x)
	return res

class Node:
	def __init__(self, i):
		self.i = i
		self.prev, self.next = None, None

def insertToList(head, t):
	t.next = head
	if head:
		head.prev = t
	return t

def removeFromList(head, t):
	if t.prev:
		t.prev.next = t.next
	if t.next:
		t.next.prev = t.prev
	if head is t:
		head = t.next
	t.prev, t.next = None, None
	return head

N = int(raw_input())
a = map(int, raw_input().split(" "))
X = 10
smallestPrimeFactor = getSmallestPrimeFactors(X)
divisors = [ getDivisors(x, smallestPrimeFactor) for x in a ]

indices = [ [] for _ in xrange(X+1) ]
for i, x in enumerate(a):
	indices[x].append(i)

offsets = [None] * N
numTotalDivisors = 0
for i in xrange(N):
	offsets[i] = numTotalDivisors
	numTotalDivisors += len(divisors[i])

nodes = [ Node(i) for i in xrange(N) for _ in xrange(len(divisors[i])) ]
heads = [ None ] * (X+1)

for x in xrange(X, 0, -1):
	for i in indices[x]:
		for j, d in enumerate(divisors[i]):
			heads[d] = insertToList(heads[d], nodes[offsets[i] + j])

curi = 0
ans = [ a[curi] ]
for k in xrange(N-1):
	for j, d in enumerate(divisors[curi]):
		heads[d] = removeFromList(heads[d], nodes[offsets[curi] + j])
	p = (X+1, X+1, -1)
	for j, d in enumerate(divisors[curi]):
		t = heads[d]
		if t:
			i = t.i
			p = min(p, (a[i] // d, a[i], i))
	curi = p[2]
	ans.append(a[curi])

print " ".join(map(str, ans))