B. Yash is Cross-Eyed
time limit per test
2 seconds
memory limit per test
256 megabytes
input
standard input
output
standard output

Given a string $$$s$$$, output "YES" if it is possible to make adjacent swaps to make $$$s$$$ of the form $$$t + t$$$ for some string $$$t$$$, and "NO" if it is not possible.

Input

Each test contains multiple test cases. The first line contains the number of test cases $$$t$$$ ($$$1 \leq t \leq10^4$$$). The description of each test case follows.

Each test case contains a single line with a string $$$s$$$ ($$$|s|\geq 1$$$, and the sum of $$$|s|$$$ over all testcases is at most $$$2\times10^5$$$). Each string consists of lowercase Latin letters.

Output

For each test case, output "YES" if it is possible to perform adjacent swaps and "NO" if otherwise.

"YES" and "NO" are case sensitive, so "yes", "nO", etc are not permitted.

Examples
Input
1
abba
Output
YES
Input
2
a
abcdeadbceff
Output
NO
YES