def solve(s, t):
    if not all(sorted(s[r::2]) == sorted(t[r::2]) for r in range(2)):
        return False
    if not all(len(set(s[r::2])) == len(s[r::2]) for r in range(2)):
        return True
    f = 0
    for r in range(2):
        for u in s, t:
            seen = 0
            for c in u[r::2]:
                v = ord(c) - 97
                f ^= (seen >> v).bit_count()
                seen |= 1 << v
    return (f & 1) == 0

for _ in range(int(input())):
    print('Yes' if solve(input(), input()) else 'No')