T = int(input())

def inversion(arr):
    cnt = [0] * 26
    ans = 0
    for v in arr:
        for j in range(v):
            ans += cnt[j]
        cnt[v] += 1
    return ans

def solve():
    s = input()
    t = input()
    odd = [0] * 26
    eve = [0] * 26
    n = len(s)
    a1 = []
    a2 = []
    a3 = []
    a4 = []
    for i in range(n):
        if i % 2 == 0:
            a1.append(ord(s[i]) - 97)
            eve[ord(s[i])-97] += 1
        if i % 2 == 1:
            a2.append(ord(s[i]) - 97)
            odd[ord(s[i])-97] += 1
    for i in range(n):
        if i % 2 == 0:
            a3.append(ord(t[i]) - 97)
            eve[ord(t[i])-97] -= 1
        if i % 2 == 1: 
            a4.append(ord(t[i]) - 97)
            odd[ord(t[i])-97] -= 1
    
    ok = min(eve+odd) == 0
    ok &= inversion(a1)%2==inversion(a3)%2
    ok &= inversion(a2)%2==inversion(a4)%2
    print("Yes" if ok else "No")
for _ in range(T):
    solve()