package main

import (
	"fmt"
	"sort"
)

func prime() func() int {
	var primes []int
	i := 2
	_isPrime := func(n int) bool {
		for _, p := range primes {
			if p > n*n {
				break
			}
			if n%p == 0 {
				return false
			}
		}
		return true
	}
	return func() int {
		for !_isPrime(i) {
			i++
		}
		primes = append(primes, i)
		return i
	}
}

func primeFactorization(n int) (factor map[int]int) {
	factor = make(map[int]int)
	primes := prime()
	for {
		d := primes()
		if d > n*n {
			break
		}
		for n%d == 0 {
			n /= d
			factor[d]++
		}
	}
	if n > 1 {
		factor[n]++
	}
	return
}

func divisors(num int) []int {
	primeFactors := primeFactorization(num)
	var pNum int
	for _, v := range primeFactors {
		pNum *= v + 1
	}
	ret := make([]int, 0, pNum)
	ret = append(ret, 1)

	for p, k := range primeFactors {
		for _, x := range ret {
			for i := 0; i < k; i++ {
				x *= p
				ret = append(ret, x)
			}
		}
	}
	sort.Ints(ret)
	return ret
}

var dp, m [10001]int

func main() {
	var N int
	fmt.Scan(&N)
	A := make([]int, N)
	for i := 0; i < N; i++ {
		fmt.Scan(&A[i])
		m[A[i]]++
	}

	next := A[0]
	m[next]--
	fmt.Print(next)

	for i := 0; i < N-1; i++ {
		divisor := divisors(next)
		check := 99999
		ans := 0

		for _, d := range divisor {
			for d*dp[d] <= 10000 {
				if m[d*dp[d]] > 0 {
					if check <= dp[d] {
						break
					}
					ans = d * dp[d]
					check = dp[d]
				} else {
					dp[d]++
				}
			}
		}

		next = ans
		m[next]--
		fmt.Print(" ", next)
	}
	fmt.Print("\n")
}