You are given two strings \(S\) and \(T\) consisting of lower case Latin letters. Your task is to determine if you can make \(S\) equal to \(T\) using the following operation:

Swap any two adjacent characters in \(S\) and also swap any two adjacent characters in \(T\).

Note: It is necessary to swap both the strings and it is not optional if you are applying operation.

Input format

The first line contains an integer \(T\) denoting the number of test cases.
The first line of each test case contains an integer denoting the length of \(S\).
The second line of each test case contain string \(S\).
The third line of each test case contain string \(T\).

Output format

Print \(T\) lines. For each test case:

Print a single line 'YES' if you can make \(S\) equal to \(T\) else 'NO'.

Constraints

\( 1\leq T \leq 20000 \)

\(1 \leq |S| =|T| \leq 200000 \)

The sum of \(|S|\) over all test cases is less than or equal to \(5\times 10^5\).