{"trustable":true,"prependHtml":"\u003cstyle type\u003d\u0027text/css\u0027\u003e\n .input, .output {\n border: 1px solid #888888;\n }\n .output {\n margin-bottom: 1em;\n position: relative;\n top: -1px;\n }\n .output pre, .input pre {\n background-color: #EFEFEF;\n line-height: 1.25em;\n margin: 0;\n padding: 0.25em;\n }\n \u003c/style\u003e\n \u003clink rel\u003d\"stylesheet\" href\u003d\"//codeforces.org/s/96598/css/problem-statement.css\" type\u003d\"text/css\" /\u003e\u003cscript\u003e window.katexOptions \u003d { disable: true }; \u003c/script\u003e\n\u003cscript type\u003d\"text/x-mathjax-config\"\u003e\n MathJax.Hub.Config({\n tex2jax: {\n inlineMath: [[\u0027$$$\u0027,\u0027$$$\u0027], [\u0027$\u0027,\u0027$\u0027]],\n displayMath: [[\u0027$$$$$$\u0027,\u0027$$$$$$\u0027], [\u0027$$\u0027,\u0027$$\u0027]]\n }\n });\n\u003c/script\u003e\n\u003cscript type\u003d\"text/javascript\" async src\u003d\"https://mathjax.codeforces.org/MathJax.js?config\u003dTeX-AMS_HTML-full\"\u003e\u003c/script\u003e","sections":[{"title":"","value":{"format":"HTML","content":"\u003cp\u003eYou 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.\u003c/p\u003e\u003cp\u003eYou 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$$$). \u003c/p\u003e\u003cp\u003eFor example, if $$$a \u003d 032867235$$$ you can get the following integers in a single operation: \u003c/p\u003e\u003cul\u003e \u003cli\u003e $$$302867235$$$ if you swap the first and the second digits; \u003c/li\u003e\u003cli\u003e $$$023867235$$$ if you swap the second and the third digits; \u003c/li\u003e\u003cli\u003e $$$032876235$$$ if you swap the fifth and the sixth digits; \u003c/li\u003e\u003cli\u003e $$$032862735$$$ if you swap the sixth and the seventh digits; \u003c/li\u003e\u003cli\u003e $$$032867325$$$ if you swap the seventh and the eighth digits. \u003c/li\u003e\u003c/ul\u003e\u003cp\u003eNote, that you can\u0027t swap digits on positions $$$2$$$ and $$$4$$$ because the positions are not adjacent. Also, you can\u0027t swap digits on positions $$$3$$$ and $$$4$$$ because the digits have the same parity.\u003c/p\u003e\u003cp\u003eYou can perform any number (possibly, zero) of such operations.\u003c/p\u003e\u003cp\u003eFind the minimum integer you can obtain.\u003c/p\u003e\u003cp\u003e\u003cspan class\u003d\"tex-font-style-bf\"\u003eNote that the resulting integer also may contain leading zeros.\u003c/span\u003e\u003c/p\u003e"}},{"title":"Input","value":{"format":"HTML","content":"\u003cp\u003eThe first line contains one integer $$$t$$$ ($$$1 \\le t \\le 10^4$$$) — the number of test cases in the input.\u003c/p\u003e\u003cp\u003eThe only line of each test case contains the integer $$$a$$$, its length $$$n$$$ is between $$$1$$$ and $$$3 \\cdot 10^5$$$, inclusive.\u003c/p\u003e\u003cp\u003eIt is guaranteed that the sum of all values $$$n$$$ does not exceed $$$3 \\cdot 10^5$$$.\u003c/p\u003e"}},{"title":"Output","value":{"format":"HTML","content":"\u003cp\u003eFor each test case print line — the minimum integer you can obtain.\u003c/p\u003e"}},{"title":"Examples","value":{"format":"HTML","content":"\u003ctable class\u003d\u0027vjudge_sample\u0027\u003e\n\u003cthead\u003e\n \u003ctr\u003e\n \u003cth\u003eInput\u003c/th\u003e\n \u003cth\u003eOutput\u003c/th\u003e\n \u003c/tr\u003e\n\u003c/thead\u003e\n\u003ctbody\u003e\n \u003ctr\u003e\n \u003ctd\u003e\u003cpre\u003e3\n0709\n1337\n246432\n\u003c/pre\u003e\u003c/td\u003e\n \u003ctd\u003e\u003cpre\u003e0079\n1337\n234642\n\u003c/pre\u003e\u003c/td\u003e\n \u003c/tr\u003e\n\u003c/tbody\u003e\n\u003c/table\u003e\n"}},{"title":"Note","value":{"format":"HTML","content":"\u003cp\u003eIn the first test case, you can perform the following sequence of operations (the pair of swapped digits is highlighted): $$$0 \\underline{\\textbf{70}} 9 \\rightarrow 0079$$$.\u003c/p\u003e\u003cp\u003eIn the second test case, the initial integer is optimal. \u003c/p\u003e\u003cp\u003eIn the third test case you can perform the following sequence of operations: $$$246 \\underline{\\textbf{43}} 2 \\rightarrow 24 \\underline{\\textbf{63}}42 \\rightarrow 2 \\underline{\\textbf{43}} 642 \\rightarrow 234642$$$.\u003c/p\u003e"}}]}