#include <bits/stdc++.h>

using namespace std;

template <typename T>
bool is_prime(T n) {
  if (n == 0 || n == 1) return false;
  if (n == 2) return true;
  if (n % 2 == 0) return false;
  for (T i = 3; i * i < n + 1; i += 2) {
    if (n % i == 0) return false;
  }
  return true;
}

int main() {
  ios::sync_with_stdio(false);
  cin.tie(nullptr);
  int T;
  cin >> T;
  auto solve = [&]() {
    int N;
    cin >> N;
    vector<int> A(N), B(N);
    for (auto &&e : A) {
      cin >> e;
    }
    for (auto &&e : B) {
      cin >> e;
    }
    vector<int> X, Y;
    for (int i = 0; i < N; i++) {
      if (i == 0 || (is_prime(i + 1) && 2 * (i + 1) > N)) {
        if (A[i] != B[i]) {
          cout << "No" << '\n';
          return;
        }
      }
      X.emplace_back(A[i]);
      Y.emplace_back(B[i]);
    }
    sort(X.begin(), X.end());
    sort(Y.begin(), Y.end());
    cout << (X == Y ? "Yes" : "No") << '\n';
  };
  for (int i = 0; i < T; i++) {
    solve();
  }
  return 0;
}