#include <cstdio>
#include <algorithm>
using namespace std;
bool cmp(int a,int b){
return a>b;
}
int main(){
int n,m,a[110];
scanf("%d",&n);
bool hashTable[10000]={false};
for(int i=0;i<n;i++){
scanf("%d",&a[i]);
m=a[i];
while(m!=1){
if(m%2==1)m=(3*m+1)/2;
else m=m/2;
hashTable[m]=true;
}
}
int count=0;
for(int i=0;i<n;i++){
if(hashTable[a[i]]==false){
count++;
}
}
sort(a,a+n,cmp);
for(int i=0;i<n;i++){
if(hashTable[a[i]]==false){
printf("%d",a[i]);
count--;
if(count>0)
printf(" ");
}
}
return 0;
}
#include <cstdio>
#include <iostream>
#include <algorithm>
using namespace std;
bool cmp(int a,int b){
return a>b;
}
bool hashTable[100010]={false};
int kk[110]={0};
int main(){
int k,count=0;
cin>>k;
for(int i=0;i<k;i++){
scanf("%d",&kk[i]);
int t=kk[i];
while(t!=1){
if(t%2==0){
t=t/2;
hashTable[t]=true;
}else{
t=(3*t+1)/2;
hashTable[t]=true;
}
}
}
for(int i=0;i<k;i++){
if(hashTable[kk[i]]==false)count++;
}
sort(kk,kk+k,cmp);
for(int i=0;i<k;i++){
if(hashTable[kk[i]]==false){
printf("%d",kk[i]);
if(count>1){
printf(" ");
count--;
}
}
}
return 0;
}