import sys
import math
import bisect
from heapq import heapify, heappop, heappush
from collections import deque, defaultdict, Counter
from functools import lru_cache
from itertools import accumulate, combinations, permutations, product

sys.setrecursionlimit(1000000)
MOD = 10 ** 9 + 7
MOD99 = 998244353

input = lambda: sys.stdin.readline().strip()
NI = lambda: int(input())
NMI = lambda: map(int, input().split())
NLI = lambda: list(NMI())
SI = lambda: input()
SMI = lambda: input().split()
SLI = lambda: list(SMI())
EI = lambda m: [NLI() for _ in range(m)]


def main():
    N = NI()
    A = NLI()
    for i in range(N-1):
        L = 10**10
        nj = N-1
        na = 10**10
        for j in range(N-1, i, -1):
            l = A[i] * A[j] // math.gcd(A[i], A[j])
            if l < L:
                L = l
                nj = j
                na = A[j]
            elif l == L and A[j] < na:
                nj = j
                na = A[j]
        A[i+1], A[nj] = A[nj], A[i+1]
        # print(A)
    print(*A)


if __name__ == "__main__":
    main()