# -*- coding: utf-8 -*-


def solve(N, data):
    GC = 1000
    memo = [[None for i in xrange(GC)] for i in xrange(GC)]

    def gcd(a, b):
        if b == 0:
            return a
        if a < GC and b < GC:
            if not (memo[a][b] is None):
                return memo[a][b]
            memo[a][b] = gcd(b, a % b)
            return memo[a][b]
        return gcd(b, a % b)

    def bcd(a, b):
        return a * b / gcd(a, b)

    result = [0] * N
    result[0] = data[0]
    del data[0]
    ans_p = 1
    while ans_p < N:
        mn = -1
        index = 0
        for i, v in enumerate(data):
            a = bcd(result[ans_p - 1], v)
            if mn == -1 or mn > a or (mn == a and data[index] > v):
                mn = a
                index = i

        result[ans_p] = data[index]
        ans_p += 1
        del data[index]
    return result


N = int(raw_input())
data = map(int, raw_input().split(" "))

print " ".join(map(str, solve(N, data)))