CF1526D.Kill Anton

After rejecting $10^{100}$ data structure problems, Errorgorn is very angry at Anton and decided to kill him.

Anton's DNA can be represented as a string $a$ which only contains the characters "ANTON" (there are only $4$ distinct characters).

Errorgorn can change Anton's DNA into string $b$ which must be a permutation of $a$. However, Anton's body can defend against this attack. In $1$ second, his body can swap $2$ adjacent characters of his DNA to transform it back to $a$. Anton's body is smart and will use the minimum number of moves.

To maximize the chance of Anton dying, Errorgorn wants to change Anton's DNA the string that maximizes the time for Anton's body to revert his DNA. But since Errorgorn is busy making more data structure problems, he needs your help to find the best string $B$. Can you help him?

在拒绝了 $10^{100}$ 道数据结构题目后，Errorgorn 对 Anton 愤怒至极，决定杀死他。

Anton 的 DNA 可以用一个仅由字符 "ANTON"（共 $4$ 种不同字符）组成的字符串 $a$ 表示。

Errorgorn 可以将 Anton 的 DNA 修改为字符串 $b$，其中 $b$ 必须是 $a$ 的一个排列。然而，Anton 的身体能抵御这种攻击：每秒，他的身体可以交换 DNA 中两个相邻的字符，从而将其逐步恢复为原始字符串 $a$；且 Anton 的身体足够聪明，总会采用最少的交换次数。

为了最大化 Anton 死亡的概率，Errorgorn 希望将 Anton 的 DNA 修改为使身体恢复所需时间最长的字符串。但由于 Errorgorn 正忙于构造更多数据结构题目，他需要你帮忙找出最优的字符串 $b$。你能帮他吗？

The first line of input contains a single integer $t$ $(1 \leq t \leq 100000)$ — the number of testcases.

The first and only line of each testcase contains $1$ string $a$ ($1 \leq |a| \leq 100000$). $a$ consists of only the characters "A", "N", "O" and "T".

It is guaranteed that the sum of $|a|$ over all testcases does not exceed $100000$.

输入的第一行包含一个整数 $t$（$1 \leq t \leq 100000$）—— 表示测试用例的数量。

每个测试用例仅有一行，包含一个字符串 $a$（$1 \leq |a| \leq 100000$）。字符串 $a$ 仅由字符 "A"、"N"、"O" 和 "T" 组成。

保证所有测试用例的 $|a|$ 之和不超过 $100000$。

For each testcase, print a single string, $b$. If there are multiple answers, you can output any one of them. $b$ must be a permutation of the string $a$.

对于每个测试用例，输出一个字符串 $b$。如果存在多个答案，你可以输出其中任意一个。$b$ 必须是字符串 $a$ 的一个排列。

For the first testcase, it takes $7$ seconds for Anton's body to transform NNOTA to ANTON:

NNOTA $\to$ NNOAT $\to$ NNAOT $\to$ NANOT $\to$ NANTO $\to$ ANNTO $\to$ ANTNO $\to$ ANTON.

Note that you cannot output strings such as AANTON, ANTONTRYGUB, AAAAA and anton as it is not a permutation of ANTON.

For the second testcase, it takes $2$ seconds for Anton's body to transform AANN to NAAN. Note that other strings such as NNAA and ANNA will also be accepted.

对于第一个测试用例，Anton 的身体需要 $7$ 秒将字符串 NNOTA 转变为 ANTON：

NNOTA $\to$ NNOAT $\to$ NNAOT $\to$ NANOT $\to$ NANTO $\to$ ANNTO $\to$ ANTNO $\to$ ANTON。

注意：你不能输出类似 AANTON、ANTONTRYGUB、AAAAA 和 anton 这样的字符串，因为它们不是 ANTON 的一个排列。

对于第二个测试用例，Anton 的身体需要 $2$ 秒将字符串 AANN 转变为 NAAN。注意：其他字符串（例如 NNAA 和 ANNA）也同样可被接受。