Problem: Sayaka Saeki is a member of the student council, which has n other members (excluding Sayaka). The i-th member has a height of a_i millimeters.

It's the end of the school year and Sayaka wants to take a picture of all other members of the student council. Being the hard-working and perfectionist girl as she is, she wants to arrange all the members in a line such that the amount of photogenic consecutive pairs of members is as large as possible.

A pair of two consecutive members u and v on a line is considered photogenic if their average height is an integer, i.e. (a_u + a_v)/(2) is an integer.

Help Sayaka arrange the other members to maximize the number of photogenic consecutive pairs.

Input

The first line contains a single integer t (1≤ t≤ 500) — the number of test cases.

The first line of each test case contains a single integer n (2 ≤ n ≤ 2000) — the number of other council members.

The second line of each test case contains n integers a_1, a_2, ..., a_n (1 ≤ a_i ≤ 2 ⋅ 10^5) — the heights of each of the other members in millimeters.

It is guaranteed that the sum of n over all test cases does not exceed 2000.

Output

For each test case, output on one line n integers representing the heights of the other members in the order, which gives the largest number of photogenic consecutive pairs. If there are multiple such orders, output any of them.

Example

Input


4
3
1 1 2
3
1 1 1
8
10 9 13 15 3 16 9 13
2
18 9


Output


1 1 2 
1 1 1 
13 9 13 15 3 9 16 10 
9 18 

Note

In the first test case, there is one photogenic pair: (1, 1) is photogenic, as (1+1)/(2)=1 is integer, while (1, 2) isn't, as (1+2)/(2)=1.5 isn't integer.

In the second test case, both pairs are photogenic.

Solution (in CPP):

Solution:
/**
 *    author:  Ujjwal Tripathi
 *    created: 15.04.2021 18:04:04
**/
 
    
#include<bits/stdc++.h>
using namespace std;
 
#define ar array<ll, 2>
#define ll long long
#define in insert
#define pb push_back
#define pii pair<ll,ll>
#define vt vector
#define P_Q(x) priority_queue<x>
#define p_q(x) priority_queue<x, vector<x>, greater<x>>
#define For(i, n) for(ll i = 0; i < n; i++)
#define Rev(i, n) for(ll i = n-1; i >= 0; i--)
#define FOR(i, n) for(ll i = 1; i <= n; i++)
#define REV(i, n) for(ll i = n; i >= 1; i--)
#define Rep(i,a,b) for(ll i = a; i <= b; i++)
#define all(x) (x).begin(),(x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define sz(x) (int) (x).size()
 
// Maximum priority queue
template <typename T>
using mxpq = priority_queue<T>;
 
// Minimum priority queue
template <typename T>
using mnpq = priority_queue<T, vt<T>, greater<T>>;
 
 
// x | (x + 1) sets lowest unset bit of x
// x & (x - 1) unsets lowest set bit of x
 
const ll mod = 1e9L + 7;
const ll INF = 1e18L + 5;
const ll mxN = 2e5 + 1;
 
 
ll n;
ll dp[1000004];
// remember to read no of test_cases
void solve()
{
   cin>>n;
   vt<ll> v(n);
   For(i,n)
   {
    cin>>v[i];
    if(v[i]%2==0)
    {
        cout<<v[i]<<" ";
    }
   }
 
    For(i,n)
    {
      if(v[i]%2==1)
      {
        cout<<v[i]<<" ";
      }
    }
    cout<<endl;
}
 
int main()
{
  ios::sync_with_stdio(0);  cin.tie(0);
  ll t = 1;
  cin >> t;
  FOR(tt, t) solve();
  return 0;
}