# haru: pypy
import sys
input = sys.stdin.readline
II = lambda : int(input())
MI = lambda : map(int, input().split())
LI = lambda : [int(a) for a in input().split()]
SI = lambda : input().rstrip()
LLI = lambda n : [[int(a) for a in input().split()] for _ in range(n)]
LSI = lambda n : [input().rstrip() for _ in range(n)]
MI_1 = lambda : map(lambda x:int(x)-1, input().split())
LI_1 = lambda : [int(a)-1 for a in input().split()]

mod = 998244353
inf = 1001001001001001001
ordalp = lambda s : ord(s)-65 if s.isupper() else ord(s)-97
ordallalp = lambda s : ord(s)-39 if s.isupper() else ord(s)-97
yes = lambda : print("Yes")
no = lambda : print("No")
yn = lambda flag : print("Yes" if flag else "No")

prinf = lambda ans : print(ans if ans < 1000001001001001001 else -1)
alplow = "abcdefghijklmnopqrstuvwxyz"
alpup = "ABCDEFGHIJKLMNOPQRSTUVWXYZ"
alpall = "abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ"
URDL = {'U':(-1,0), 'R':(0,1), 'D':(1,0), 'L':(0,-1)}
DIR_4 = [[-1,0],[0,1],[1,0],[0,-1]]
DIR_8 = [[-1,0],[-1,1],[0,1],[1,1],[1,0],[1,-1],[0,-1],[-1,-1]]
DIR_BISHOP = [[-1,1],[1,1],[1,-1],[-1,-1]]
prime60 = [2,3,5,7,11,13,17,19,23,29,31,37,41,43,47,53,59]
sys.set_int_max_str_digits(0)
# sys.setrecursionlimit(10**6)
# import pypyjit
# pypyjit.set_param('max_unroll_recursion=-1')

from collections import defaultdict,deque
from heapq import heappop,heappush
from bisect import bisect_left,bisect_right
DD = defaultdict
BSL = bisect_left
BSR = bisect_right

"""
流石に嘘
flip 回数が等しいので、転倒数の偶奇かな？
"""

def solve():
    s = SI()
    t = SI()
    n = len(s)
    
    f = sorted(s[::2]) == sorted(t[::2])
    g = sorted(s[1::2]) == sorted(t[1::2])
    
    def calc(p):
        c = 0
        for i in range(p, n, 2):
            for j in range(i, n, 2):
                if s[i] > s[j]: 
                    c ^= 1
                if t[i] > t[j]:
                    c ^= 1
        return c 
    
    cnt = [0] * 26
    for c in s[::2]:
        cnt[ordalp(c)] += 1
        
    cnt2 = [0] * 26
    for c in s[1::2]:
        cnt2[ordalp(c)] += 1
    
    if max(cnt) >= 2 or max(cnt2) >= 2:
        yn(f & g)
    else:
        f2 = calc(0)
        g2 = calc(1)
        
        yn(f & g & (f2 == g2))
        # そうでないときは？
        
        
        
    return

t = int(input())
for i in range(t):
    solve()