#include <bits/stdc++.h>
#define all(x) x.begin(),x.end()
#define pb push_back
#define pf push_front
#define f first
#define s second
#define left(v) v + v
#define right(v) v + v + 1
#define sq(x) ll(x * x)

using namespace std;
typedef long long ll;

const double Pi = acos(-1.0);
const ll dx[] = {0,0,1,-1};
const ll dy[] = {1,-1,0,0};
const ll N = (ll) 1e6 + 17;
const ll M = (ll) 2e3 + 69;
const ll inf = (ll) 1e14 + 3;
const ll mod = (ll) 1e9 + 7;

ll t = 1, a[N];

vector<ll> v1, v2;

void solve() {
    ll n;
    cin >> n;
    for(ll i = 1; i <= n; i++) {
        cin >> a[i];
        if(a[i] % 2) v1.pb(a[i]);
        else v2.pb(a[i]);
    }
    for(ll i = 0; i < v1.size(); i++) {
        cout << v1[i] << " ";
    }
    for(ll i = 0; i < v2.size(); i++) {
        cout << v2[i] << " ";
    }
    cout << "\n";
    v1.clear();
    v2.clear();
}

int main() {
ios_base::sync_with_stdio(0);
    cin.tie(0);
/*
	freopen(".in", "r", stdin);
	freopen(".out", "w", stdout);
*/
    cin >> t;
    while(t--) {
        solve();
    }
  	return 0;
}
// さよならさ いかなくちゃ
