import fractions

N = int(input())
A = list(map(int, input().split()))
N=5
A = [1,2,3,4,5]
B = A[1:]
B.sort()
A = [A[0]] + B

def solve(A):
    an = A[-1]
    mygcd = fractions.gcd
    for i in range(N-2):
        ai = A[i]
        lcm_min = ai * an
        target = i
        for j in range(i + 1, N):
            aj = A[j]
            lcm = ai * aj // mygcd(ai, aj)
            if lcm < lcm_min:
                lcm_min = lcm
                target = j
            if aj >= lcm_min:
                break
        A[i + 1], A[target] = A[target], A[i + 1]
    return A

print(*solve(A))