package main import ( "bufio" "fmt" "math" "os" "sort" "strconv" ) func out(x ...interface{}) { fmt.Println(x...) } var sc = bufio.NewScanner(os.Stdin) func getInt() int { sc.Scan() i, e := strconv.Atoi(sc.Text()) if e != nil { panic(e) } return i } func getInts(N int) []int { ret := make([]int, N) for i := 0; i < N; i++ { ret[i] = getInt() } return ret } func getString() string { sc.Scan() return sc.Text() } // min, max, asub, absなど基本関数 func max(a, b int) int { if a > b { return a } return b } func min(a, b int) int { if a < b { return a } return b } func asub(a, b int) int { if a > b { return a - b } return b - a } func abs(a int) int { if a >= 0 { return a } return -a } func lowerBound(a []int, x int) int { idx := sort.Search(len(a), func(i int) bool { return a[i] >= x }) return idx } func upperBound(a []int, x int) int { idx := sort.Search(len(a), func(i int) bool { return a[i] > x }) return idx } // GCD : greatest common divisor (GCD) via Euclidean algorithm func GCD(a, b int) int { for b != 0 { t := b b = a % b a = t } return a } // LCM : find Least Common Multiple (LCM) via GCD func LCM(a, b int, integers ...int) int { result := a / GCD(a, b) * b for i := 0; i < len(integers); i++ { result = LCM(result, integers[i]) } return result } func lcmSort(x int, a []int) []int { if len(a) == 0 { return a } minLCM := math.MaxInt64 pos := 0 for i := 0; i < len(a); i++ { y := LCM(x, a[i]) if y < minLCM { minLCM = y pos = i } else if y == minLCM && a[i] < a[pos] { minLCM = y pos = i } } a[0], a[pos] = a[pos], a[0] return a } func main() { sc.Split(bufio.ScanWords) N := getInt() a := getInts(N) w := bufio.NewWriter(os.Stdout) defer w.Flush() for i := 0; i < N-1; i++ { fmt.Fprint(w, a[i], " ") minLCM := math.MaxInt64 pos := 0 for j := i + 1; j < N; j++ { y := LCM(a[i], a[j]) if y < minLCM { minLCM = y pos = j } else if y == minLCM && a[j] < a[pos] { minLCM = y pos = j } } a[i+1], a[pos] = a[pos], a[i+1] } fmt.Fprintln(w, a[N-1]) }