#include <cassert>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <bitset>
#include <chrono>
#include <complex>
#include <deque>
#include <functional>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>

using namespace std;

using Int = long long;

template <class T> ostream &operator<<(ostream &os, const vector<T> &as);
template <class T1, class T2> ostream &operator<<(ostream &os, const pair<T1, T2> &a) { return os << "(" << a.first << ", " << a.second << ")"; };
template <class T> ostream &operator<<(ostream &os, const vector<T> &as) { const int sz = as.size(); os << "["; for (int i = 0; i < sz; ++i) { if (i >= 256) { os << ", ..."; break; } if (i > 0) { os << ", "; } os << as[i]; } return os << "]"; }
template <class T> void pv(T a, T b) { for (T i = a; i != b; ++i) cerr << *i << " "; cerr << endl; }
template <class T> bool chmin(T &t, const T &f) { if (t > f) { t = f; return true; } return false; }
template <class T> bool chmax(T &t, const T &f) { if (t < f) { t = f; return true; } return false; }
#define COLOR(s) ("\x1b[" s "m")


void exper() {
  for (int N = 4; N <= 12; ++N) {
    queue<vector<int>> que;
    set<vector<int>> vis;
    {
      vector<int> ps(N);
      for (int i = 0; i < N; ++i) ps[i] = i;
      vis.insert(ps);
      que.push(ps);
    }
    for (; que.size(); ) {
      const auto ps = que.front();
      que.pop();
      for (int i = 0; i + 4 <= N; ++i) {
        auto qs = ps;
        rotate(qs.begin() + i, qs.begin() + (i + 2), qs.begin() + (i + 4));
        if (vis.insert(qs).second) que.push(qs);
      }
    }
    for (const auto &ps : vis) cout << ps << "\n";
    cout << endl;
    cerr << "N = " << N << ": " << vis.size() << endl;
  }
}
/*
N = 4: 2
N = 5: 6
N = 6: 18
N = 7: 72
N = 8: 288
N = 9: 1440
N = 10: 7200
N = 11: 43200
N = 12: 259200
*/

int sub(const string &s, const string &t) {
  const int n = s.size();
  auto ss = s, tt = t;
  sort(ss.begin(), ss.end());
  sort(tt.begin(), tt.end());
  if (ss != tt) return 0;
  for (int i = 1; i < n; ++i) if (ss[i - 1] == ss[i]) return 3;
  int iv = 0;
  for (int i = 0; i < n; ++i) for (int j = i + 1; j < n; ++j) if (s[i] > s[j]) ++iv;
  for (int i = 0; i < n; ++i) for (int j = i + 1; j < n; ++j) if (t[i] > t[j]) ++iv;
  return 1 << (iv&1);
}

int N;
char S[1'000'010];
char T[1'000'010];

int main() {
  // exper(); return 0;
  
  for (int numCases; ~scanf("%d", &numCases); ) { for (int caseId = 1; caseId <= numCases; ++caseId) {
    scanf("%s", S);
    scanf("%s", T);
    N = strlen(S);
    
    string ss[2], ts[2];
    for (int i = 0; i < N; ++i) ss[i & 1] += S[i];
    for (int i = 0; i < N; ++i) ts[i & 1] += T[i];
    int fs[2];
    for (int u = 0; u < 2; ++u) fs[u] = sub(ss[u], ts[u]);
    puts((fs[0] & fs[1]) ? "Yes" : "No");
  }
#ifndef LOCAL
  break;
#endif
  }
  return 0;
}