from collections import Counter

def inv(a, b):
    pos = [-1] * 26
    for i in range(len(b)):
        pos[b[i]] = i
    result = 0
    count = [0] * 26
    for c in a:
        c = pos[c]
        result += sum(count[c+1:])
        count[c] += 1
    return result

for _ in range(int(input())):
    S = input()
    T = input()
    N = len(S)
    s0 = [ord(c) - ord('a') for c in S[0:N:2]]
    s1 = [ord(c) - ord('a') for c in S[1:N:2]]
    t0 = [ord(c) - ord('a') for c in T[0:N:2]]
    t1 = [ord(c) - ord('a') for c in T[1:N:2]]
    cs0 = Counter(s0)
    cs1 = Counter(s1)
    if cs0 != Counter(t0) or cs1 != Counter(t1):
        print("No")
        continue
    if any(v > 1 for v in cs0.values()) or any(v > 1 for v in cs1.values()):
        print("Yes")
        continue
    if (inv(s0, t0) + inv(s1, t1)) % 2 == 0:
        print("Yes")
    else:
        print("No")