H. Stringmaster
time limit per test
2 seconds
memory limit per test
1024 megabytes
input
standard input
output
standard output

After years of training, you have finally awakened your true power and become a stringmaster, allowing you to perform the following operation on a string:

Choose a subsequence$$$^{\text{∗}}$$$ that is a palindrome$$$^{\text{†}}$$$ and arbitrarily permute the characters at the selected positions.

Here is an example of such an operation where we select the palindrome tst: $$$$$$ \mathtt{{\color{red}t}e{\color{red}{st}}ing} \;\to\; \mathtt{{\color{red}s}e{\color{red}{tt}}ing} $$$$$$

Now you have a string $$$x$$$, and you want to know if you can turn it into a string $$$y$$$ by performing the above operation any number of times (possibly zero).

$$$^{\text{∗}}$$$A string $$$a$$$ is a subsequence of a string $$$b$$$ if a can be obtained from $$$b$$$ by the deletion of several (possibly zero or all) characters.

$$$^{\text{†}}$$$A string is called a palindrome if it is the same when written in reverse order. For example, eertree and abba are palindromes.

Input

Each test contains multiple test cases. The first line contains the number of test cases $$$t$$$ ($$$1 \le t \le 10^4$$$). The description of the test cases follows.

The first line of each test case contains a single integer $$$n$$$ ($$$1 \le n \le 2 \cdot 10^5$$$) — the length of the strings $$$x$$$ and $$$y$$$.

The second line of each test case contains a string $$$x$$$ of length $$$n$$$ consisting of lowercase Latin letters.

The third line of each test case contains a string $$$y$$$ of length $$$n$$$ consisting of lowercase Latin letters.

It is guaranteed that the sum of $$$n$$$ over all test cases does not exceed $$$2 \cdot 10^5$$$.

Output

For each test case, output YES if you can turn $$$x$$$ into $$$y$$$, and NO otherwise.

You can output YES and NO in any case (for example, yES, yes, and Yes will be accepted).

Example
Input
6
7
testing
setting
5
trees
steer
6
thomas
thomas
5
beleb
volov
10
pactisaywa
piscataway
12
brunswicknew
newbrunswick
Output
YES
NO
YES
NO
YES
NO
Note

The solution to the first test case is shown above.

In the second test case, it is not possible to change the string.

In the third test case, no operations are needed.