#include <bits/stdc++.h>
using namespace std;

struct BIT {
    int N;
    vector<int> bit;

    BIT(int n) : N(n), bit(n + 1, 0) {}

    void add(int i) {
        for (; i <= N; i += i & -i) {
            bit[i]++;
        }
    }

    int sum(int i) {
        int res = 0;
        for (; i > 0; i -= i & -i) {
            res += bit[i];
        }
        return res;
    }
};

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    const int C = 26;

    int Q;
    cin >> Q;

    while (Q--) {
        string S, T;
        cin >> S >> T;
        int N = S.size();

        vector<vector<int>> A(2, vector<int>(C));
        vector<vector<int>> B(2, vector<int>(C));

        for (int i = 0; i < N; i++) {
            A[i % 2][S[i] - 'a']++;
            B[i % 2][T[i] - 'a']++;
        }

        if (A != B) {
            cout << "No\n";
            continue;
        }

        vector<queue<int>> pos(2 * C);

        for (int i = 0; i < N; i++) {
            int p = i % 2;
            int c = T[i] - 'a';
            pos[p * C + c].push(i + 1);
        }

        vector<int> P(N);

        for (int i = 0; i < N; i++) {
            int p = i % 2;
            int c = S[i] - 'a';

            P[i] = pos[p * C + c].front();
            pos[p * C + c].pop();
        }

        BIT bit(N);
        long long inv = 0;

        for (int i = 0; i < N; i++) {
            inv += i - bit.sum(P[i]);
            bit.add(P[i]);
        }

        cout << (inv % 2 == 0 ? "Yes" : "No") << '\n';
    }

    return 0;
}