import sys
sys.setrecursionlimit(15 * 10 ** 7)
def gcd(m, n):
  if n == 0:
    return m
  else:
    return gcd(n, m % n)
N = int(input())
A = list(map(int, input().split()))
for i in range(N-1):
    mv = float('inf')
    mj = -1
    for j in range(i+1, N):
        lcm = A[i] * A[j] // gcd(A[i], A[j])
        if lcm < mv:
            mv = lcm
            mj = j
        elif lcm == mv and A[mj] > A[j]:
            mj = j
    A[i+1], A[mj] = A[mj], A[i+1]
print(' '.join(map(str, A)))