#include <bits/stdc++.h>
using namespace std;
#define int long long
#define pb push_back
#define mp make_pair
#define F first
#define S second
#define pii pair<int,int>
#define mii map<int,int>
#define vec vector<int>
#define clz(a)      __builtin_clz(a) // count leading zeroes
#define ctz(a)      __builtin_ctz(a) // count trailing zeroes
#define popc(a)     __builtin_popcount(a) // count set bits (for ints only diff for ll)
#define rep(i,a,b) for(int i=a;i<b;i++)
#define debug(x)    cerr << #x << " = " << x << endl;
#define tr(container, it) \
for(typeof(container.begin()) it = container.begin(); it != container.end(); it++)
#define present(container, element) (container.find(element) != container.end())

int fact(int n);
int ncr(int n, int r);
int gcd (int a, int b);
int lcm (int a,int b);
bool isprime (int n);

int fact(int n)
{
    int res = 1;
    for (int i = 2; i <= n; i++)
        res = res * i;
    return res;
}

int ncr(int n, int r)
{
    return fact(n) / (fact(r) * fact(n - r));
}

int gcd (int a, int b)
{
    if (b == 0)
        return a;
    return gcd(b, a % b);
}

int lcm (int a,int b)
{
    return (a / gcd(a, b)) * b;
}

bool isprime (int n)
{
    if (n <= 1)
        return false;
    if (n <= 3)
        return true;
    if (n % 2 == 0 || n % 3 == 0)
        return false;

    for (int i = 5; i * i <= n; i = i + 6)
        if (n % i == 0 || n % (i + 2) == 0)
            return false;

    return true;
}

void solve () {
    int n;
    std::cin >> n;

    vector <int> arr(n);

    for (size_t i = 0; i < n; i++) {
        std::cin >> arr[i];
    }

    vector <int> even;
    vector <int> odd;

    for (size_t i = 0; i < n; i++) {
        if ((arr[i] % 2) == 0)
            even.push_back (arr[i]);
        if ((arr[i] % 2) != 0)
            odd.push_back (arr[i]);
    }

    int os = odd.size();
    int es = even.size();

    for (size_t i = 0; i < os; i++) {
        std::cout << odd[i] << " ";
    }
    for (size_t i = 0; i < es; i++) {
        std::cout << even[i] << " ";
    }
    std::cout << '\n';
}

int32_t main ()
{
    cin.tie(NULL);
    ios_base::sync_with_stdio(false);
    int t;
    cin >> t;

    while(t--) {
    solve();
    }
    return 0;
}
