D. Divide by three, multiply by two（cf） (简单dfs)

Polycarp likes to play with numbers. He takes some integer number x, writes it down on the board, and then performs with it n−1operations 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 nn 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.

Input

The first line of the input contatins an integer number n (2≤n≤100) — the number of the elements in the sequence. The second line of the input contains nn integer numbers a1,a2,…,an (1≤ai≤3⋅10^18) — rearranged (reordered) sequence that Polycarp can wrote down on the board.

Output

Print nn 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.

Examples

input

Copy

6
4 8 6 3 12 9

output

9 3 6 12 4 8 

input

4
42 28 84 126

output

126 42 84 28 

input

Copy

2
1000000000000000000 3000000000000000000

output

Copy

3000000000000000000 1000000000000000000 

Note

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

第一个数可以是任意的，后面那个数是前面那个数的1/3或2倍，那么按照这样的规则，如果搜完这n步，则结束。

#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
LL a[105],ans[105];
int n,vis[105],flag=1;
void dfs(int k)
{
    if(k>n+1) return;
    if(k==n+1)
    {
        for(int i=1;i<=n;i++) printf("%lld ",ans[i]);
        printf("\n");
        flag=0;
        return;
    }
    for(int i=1;i<=n;i++)
    {
        if(vis[i]) continue;
        if(ans[k-1]%a[i]==0&&a[i]*3==ans[k-1])
        {
            ans[k]=a[i];
            vis[i]=1;
            dfs(k+1);
            vis[i]=0;
        }
        else if(a[i]%ans[k-1]==0&&a[i]==2*ans[k-1])
        {
            ans[k]=a[i];
            vis[i]=1;
            dfs(k+1);
            vis[i]=0;
        }
    }
}
int main()
{
    scanf("%d",&n);
    for(int i=1;i<=n;i++) scanf("%lld",&a[i]);
    memset(vis,0,sizeof(vis));
    for(int i=1;i<=n&&flag;i++)
    {
        vis[i]=1;
        ans[1]=a[i];
        dfs(2);
        vis[i]=0;
    }
}