Chuck McGill suffers from electromagnetic hypersensitivity: he is afraid of electricity. But did you know he is also afraid of palindromes?
Once he received a string $$$s$$$ as a birthday present from Jimmy. He wants to rearrange its symbols, obtaining string $$$t$$$, so that the following condition holds:
Can you help him?
As a reminder, a string $$$s$$$ is called a palindrome, if it reads the same backwards as forwards. For example, aibohphobia is a palindrome.
The first line contains a single integer $$$t$$$ ($$$1 \le t \le 10^5$$$) — the number of test cases. The description of test cases follows.
The only line of each test case contains a string $$$s$$$, consisting of lowercase Latin letters.
It is guaranteed that the sum of lengths of $$$s$$$ over all test cases does not exceed $$$10^6$$$.
For each test case, if there is no such way to rearrange characters of $$$s$$$, print NO.
Otherwise, print YES. On the next line output a single string $$$t$$$. It should be the rearrangement of characters of $$$s$$$, and it should satisfy the condition from the statement.
You can print YES and NO in any case (e.g. the strings yEs, yes, Yes will be taken as a positive answer).
5asosabbaicpctenet
YES a YES oss NO YES icpc YES tente
| Name |
|---|


