package rounda;
import java.io.File;
import java.io.FileNotFoundException;
import java.io.FileOutputStream;
import java.io.IOException;
import java.util.ArrayList;
import java.util.Collections;
import java.util.Comparator;
import java.util.Scanner;
public class Problem2 {
public void solve() {
}
public static void output(int no,ArrayList list) {
String s = "";
for(int i=0;i< list.size();i++)
s+=list.get(i)+" ";
s = s.trim();
System.out.println("Case #"+no+": "+s);
}
public static void main(String[] args) {
Scanner scanner;
scanner = new Scanner(System.in);
int T = scanner.nextInt();
int count = T;
while (count-- > 0) {
int n = scanner.nextInt();
ArrayList list = new ArrayList();
ArrayList even = new ArrayList();
ArrayList odd = new ArrayList();
ArrayList result = new ArrayList();
for(int i=0;i
int next = scanner.nextInt();
list.add(next);
if(next%2==0)
even.add(next);
else
odd.add(next);
}
Collections.sort(even, new Comparator() {
@Override
public int compare(Integer o1, Integer o2) {
return o2-o1;
}
});
Collections.sort(odd, new Comparator() {
@Override
public int compare(Integer o1, Integer o2) {
return o1-o2;
}
});
int peven=0;
int podd=0;
for(int i=0;i
if(list.get(i)%2==0){
result.add(even.get(peven));
peven++;
}else{
result.add(odd.get(podd));
podd++;
}
}
output(T-count,result);
}
}
}