package main

import (
	"fmt"
)

var key int

func main() {
	var N int
	fmt.Scan(&N)
	a := make([]int, N)
	for i := 0; i < N; i++ {
		fmt.Scan(&a[i])
	}
	if len(a) > 1 {
		lcmSort(a[0], a[1:])
	}
	ans := fmt.Sprintln(a)
	fmt.Println(ans[1 : len(ans)-2])
}

func lcmSort(k int, a []int) {
	if len(a) == 1 {
		return
	}

	b := make([]int, len(a))
	for i := range a {
		b[i] = lcm(k, a[i])
	}

	if b[1] < b[0] || (b[1] == b[0] && a[1] < a[0]) {
		a[0], a[1] = a[1], a[0]
		b[0], b[1] = b[1], b[0]
	}

	for i := range a {
		if i == 0 || i == 1 {
			continue
		}
		if less(a, b, i, 0) {
			a[0], a[1], a[i] = a[i], a[0], a[1]
			b[0], b[1], b[i] = b[i], b[0], b[1]
		} else if less(a, b, i, 1) {
			a[1], a[i] = a[i], a[1]
			b[1], b[i] = b[i], b[1]
		}
	}
	lcmSort(a[0], a[1:])
}
func less(a, b []int, i, j int) bool {
	if b[i] == b[j] {
		return a[i] < a[j]
	}
	return b[i] < b[j]
}
func lcm(a, b int) int {
	g := gcd(a, b)
	return (a / g) * (b / g) * g
}

func gcd(a, b int) int {
	if a > b {
		a, b = b, a
	}
	if a == 0 {
		return b
	}

	return gcd(b%a, a)
}