#include<stdio.h>
int ordering(int ar[],int n)
{
    int i,j,temp;
    for(i=0;i<n;i++)
    {
        for(j=0;j<n-1-i;j++)
        {
            if(ar[j]<ar[j+1])
            {
                temp=ar[j];
                ar[j]=ar[j+1];
                ar[j+1]=temp;
            }
        }
    }
    for(i=0;i<n;i++)
    {
        printf("%d ",ar[i]);
    }

}int orderingdif(int ar[],int n)
{
    int i,j,temp;
    for(i=0;i<n;i++)
    {
        for(j=0;j<n-1-i;j++)
        {
            if(ar[j]<ar[j+1])
            {
                temp=ar[j];
                ar[j]=ar[j+1];
                ar[j+1]=temp;
            }
        }
    }
    for(i=0;i<n;i++)
    {
        printf("%d ",ar[i]);
        if(i==n-1)printf("\n");

    }

}
int main()
{

int i,j,t,n,ar[10000],ar5[10000],ar3[10000],ar2[10000],ardif[10000],k5,k3,k2,kdif;
scanf("%d",&t);
k5=k3=k2=kdif=0;
for(i=0;i<t;i++)
{
    scanf("%d",&n);
    for(j=0;j<n;j++)
    {
        scanf("%d",&ar[j]);
        if(ar[j]%5==0){ar5[k5]=ar[j];k5++;}
        else if(ar[j]%3==0){ar3[k3]=ar[j];k3++;}
        else if(ar[j]%2==0){ar2[k2]=ar[j];k2++;}
         else{ardif[kdif]=ar[j];kdif++;}

    }
    ordering(ar5,k5);
    ordering(ar3,k3);
    ordering(ar2,k2);
    orderingdif(ardif,kdif);
    k5=k3=k2=kdif=0;

}


}