CF1626A.Equidistant Letters

You are given a string $s$, consisting of lowercase Latin letters. Every letter appears in it no more than twice.

Your task is to rearrange the letters in the string in such a way that for each pair of letters that appear exactly twice, the distance between the letters in the pair is the same. You are not allowed to add or remove letters.

It can be shown that the answer always exists. If there are multiple answers, print any of them.

给你一个字符串 $s$，由小写拉丁字母组成。其中每个字母至多出现两次。

你的任务是重新排列该字符串中的字母，使得对于每一个恰好出现两次的字母对，该字母对中两个字母之间的距离相等。你不能添加或删除任何字母。

可以证明，答案总是存在的。如果存在多个答案，输出任意一个即可。

The first line contains a single integer $t$ ($1 \le t \le 10^3$) — the number of testcases.

Each testcase consists of a non-empty string $s$, consisting of lowercase Latin letters. Every letter appears in the string no more than twice. The length of the string doesn't exceed $52$.

第一行包含一个整数 $t$（$1 \le t \le 10^3$）—— 测试用例的数量。

每个测试用例由一个非空字符串 $s$ 组成，该字符串仅包含小写拉丁字母。字符串中每个字母至多出现两次。字符串的长度不超过 $52$。

For each testcase, print a single string. Every letter should appear in it the same number of times as it appears in string $s$. For each pair of letters that appear exactly twice, the distance between the letters in the pair should be the same.

If there are multiple answers, print any of them.

对于每个测试用例，输出一个字符串。该字符串中每个字母的出现次数应与字符串 $s$ 中对应字母的出现次数完全相同。对于每一对恰好出现两次的字母，该对字母在字符串中的距离应相等。

如果存在多个合法答案，输出任意一个即可。

In the first testcase of the example, the only letter that appears exactly twice is letter 'l'. You can rearrange the letters arbitrarily, since there are no distances to compare.

In the second testcase of the example, the letters that appear exactly twice are 'a', 'b' and 'c'. Initially, letters 'a' are distance $6$ apart, letters 'b' are distance $4$ apart and letters 'c' are distance $2$ apart. They are not the same, so we have to rearrange the letters. After rearrangement, letters 'a' are distance $2$ apart, letters 'b' are distance $2$ apart and letters 'c' are distance $2$ apart. They are all the same, so the answer is valid.

In the third testcase of the example, there are no letters that appear exactly twice. Thus, any rearrangement is valid. Including not changing the string at all.

在示例的第一个测试用例中，唯一恰好出现两次的字母是字母 'l'。由于不存在需要比较的距离，因此可以任意重排这些字母。

在示例的第二个测试用例中，恰好出现两次的字母是 'a'、'b' 和 'c'。初始状态下，字母 'a' 之间的距离为 $6$，字母 'b' 之间的距离为 $4$，字母 'c' 之间的距离为 $2$。这些距离互不相等，因此必须重排字母。重排后，字母 'a' 之间的距离为 $2$，字母 'b' 之间的距离为 $2$，字母 'c' 之间的距离也为 $2$。此时所有距离均相同，因此该答案是有效的。

在示例的第三个测试用例中，不存在恰好出现两次的字母。因此，任意重排都是有效的，包括完全不改变原字符串。