#include <iostream>

 #include <cstdio>

 #include <algorithm>

 #define ll long long

 #define Max 105

 using namespace std;

 int n;

 struct node{

     ll val;

     ll count;

 };

 node num[Max + ];

 bool cmp(node x,node y){

     if(x.count == y.count){

         return x.val < y.val;

     }

     else{

         return x.count > y.count;

     }

 }

 int div(ll x){

     int cnt = ;

     while(x %  == ){

         x /= ;

         cnt++;

     }

     return cnt;

 }

 int main(){

     scanf("%d",&n);

     for(int i = ; i < n; i++){

         scanf("%lld",&num[i].val);

         num[i].count = div(num[i].val);

     }

     sort(num,num+n,cmp);

     for(int i =  ; i < n; i++)

         printf("%lld ",num[i].val);

 }