A13023 | Minimize The Integer

You are given a huge integer $a$ consisting of $n$ digits ( $n$ is between $1$ and $3 \cdot 10^5$ , inclusive). It may contain leading zeros.

You can swap two digits on adjacent (neighboring) positions if the swapping digits are of different parity (that is, they have different remainders when divided by $2$ ).

For example, if $a = 032867235$ you can get the following integers in a single operation:

- $302867235$ if you swap the first and the second digits;
- $023867235$ if you swap the second and the third digits;
- $032876235$ if you swap the fifth and the sixth digits;
- $032862735$ if you swap the sixth and the seventh digits;
- $032867325$ if you swap the seventh and the eighth digits.

Note, that you can't swap digits on positions $2$ and $4$ because the positions are not adjacent. Also, you can't swap digits on positions $3$ and $4$ because the digits have the same parity.

You can perform any number (possibly, zero) of such operations.

Find the minimum integer you can obtain.

Note that the resulting integer also may contain leading zeros.

The first line contains one integer $t$ ( $1 \le t \le 10^4$ ) — the number of test cases in the input.

The only line of each test case contains the integer $a$ , its length $n$ is between $1$ and $3 \cdot 10^5$ , inclusive.

It is guaranteed that the sum of all values $n$ does not exceed $3 \cdot 10^5$ .

For each test case print line — the minimum integer you can obtain.