CF977D.Divide by three, multiply by two

Polycarp likes to play with numbers. He takes some integer number $x$, writes it down on the board, and then performs with it $n - 1$ operations of the two kinds:

• divide the number $x$ by $3$ ($x$ must be divisible by $3$);
• multiply the number $x$ by $2$.

After each operation, Polycarp writes down the result on the board and replaces $x$ by the result. So there will be $n$ numbers on the board after all.

You are given a sequence of length $n$ — the numbers that Polycarp wrote down. This sequence is given in arbitrary order, i.e. the order of the sequence can mismatch the order of the numbers written on the board.

Your problem is to rearrange (reorder) elements of this sequence in such a way that it can match possible Polycarp's game in the order of the numbers written on the board. I.e. each next number will be exactly two times of the previous number or exactly one third of previous number.

It is guaranteed that the answer exists.

波利卡普喜欢玩数字游戏。他取某个整数 $x$，将其写在黑板上，然后对它执行 $n - 1$ 次操作，每次操作为以下两种之一：

• 将数字 $x$ 除以 $3$（要求 $x$ 能被 $3$ 整除）；
• 将数字 $x$ 乘以 $2$。

每次操作后，波利卡普将结果写在黑板上，并用该结果替换当前的 $x$。因此，全部操作结束后，黑板上共有 $n$ 个数字。

现给你一个长度为 $n$ 的序列——即波利卡普写下的这些数字。该序列以任意顺序给出，即其顺序可能与黑板上数字的实际书写顺序不一致。

你的任务是重新排列（重排序）该序列中的元素，使其能够对应波利卡普游戏过程中黑板上数字的实际书写顺序。即：序列中每个后续数字，必须恰好等于前一个数字的 $2$ 倍，或恰好等于前一个数字的 $\frac{1}{3}$。

题目保证答案一定存在。

The first line of the input contatins an integer number $n$ ($2 \le n \le 100$) — the number of the elements in the sequence. The second line of the input contains $n$ integer numbers $a_1, a_2, \dots, a_n$ ($1 \le a_i \le 3 \cdot 10^{18}$) — rearranged (reordered) sequence that Polycarp can wrote down on the board.

输入的第一行包含一个整数 $n$（$2 \le n \le 100$）——表示序列中元素的个数。
输入的第二行包含 $n$ 个整数 $a_1, a_2, \dots, a_n$（$1 \le a_i \le 3 \cdot 10^{18}$）——即 Polycarp 可能写在黑板上的、经过重排（重新排序）后的序列。

Print $n$ integer numbers — rearranged (reordered) input sequence that can be the sequence that Polycarp could write down on the board.

It is guaranteed that the answer exists.

输出 $n$ 个整数——即输入序列的一个重排（重新排序），该重排后的序列可以是 Polycarp 写在黑板上的序列。

保证答案存在。

In the first example the given sequence can be rearranged in the following way: $[9, 3, 6, 12, 4, 8]$. It can match possible Polycarp's game which started with $x = 9$.

在第一个例子中，给定的序列可以重新排列为如下形式：$[9, 3, 6, 12, 4, 8]$。该排列符合 Polycarp 可能进行的游戏过程，该游戏起始于 $x = 9$。