#include <bits/stdc++.h>
#include<unordered_set>
using namespace std;
#define ll long long int
#define f1(i,n) for(i=0;i<n;i++)
#define f2(i,a,n) for(i=n-1;i>=a;i--)
#define f3(i,a,n) for(i=a;i<n;i++)
#define vl vector<long long int>
#define um unordered_map<ll,ll>
#define us unordered_set<ll>
#define pb push_back
#define mp make_pair
#define sv(v) sort(v.begin(),v.end())
#define rv(v) reverse(v.begin(),v.end())
#define sa(v,n) sort(v,v+n)
#define ra(v,n) sort(v,v+n,greater<int>())
#define mod 1000000007


void solution(){
	ll k{},kg{},l{},h{},r{},u{},n=0,m{},p{},x=0,y{},o=0,sum=0,sum1{},pos{},ch=0,c1=0,c2=0,i=0,j=0,ans=0,a{},b=0,c=0,i1,i2,p1,q,d=0,w,result{},avg{};
	string s,s1,s2;
	cin>>n;
	vl v,v1;
	//map<ll,ll> mp;
	f1(i,n){
		cin>>x;
		if(x%2==0) v.pb(x);
		else v1.pb(x);
		
	}
	f1(i,v.size()) cout<<v[i]<<" ";
	f1(i,v1.size()) cout<<v1[i]<<" ";
	cout<<endl;
	
}
//nobody read comments!
int main() {
	ios_base::sync_with_stdio(false);
    cin.tie(NULL);
	ll t=1;
    cin>>t;
    while(t--)
    solution();
    return 0;
}
