#include <algorithm>
#include <cassert>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <vector>
using namespace std;
using ll = long long;
#define rep(i, j, n) for (int i = j; i < (n); ++i)
#define rrep(i, j, n) for (int i = (n)-1; j <= i; --i)
#define all(a) a.begin(), a.end()
template <typename T>
std::ostream &operator<<(std::ostream &os, std::vector<T> &a) {
  for (size_t i = 0; i < a.size(); ++i) os << (i > 0 ? " " : "") << a[i];
  return os << '\n';
}
template <typename T>
std::istream &operator>>(std::istream &is, std::vector<T> &a) {
  for (T &x : a) { is >> x; }
  return is;
}

[[maybe_unused]] constexpr long long MOD = 998244353;
// constexpr int MOD = 1000000007;
[[maybe_unused]] constexpr int INF = 0x3f3f3f3f;
[[maybe_unused]] constexpr long long INFL = 0x3f3f3f3f3f3f3f3fLL;

int main() {
  cin.tie(0)->sync_with_stdio(0);
  int t;
  cin >> t;
  while (t--) {
    int n;
    cin >> n;
    vector<int> a(n), b(n);
    cin >> a >> b;
    if (a[0] != b[0]) {
      cout << "No" << '\n';
      continue;
    }
    vector<bool> used(n);
    vector<int> c, d;
    bool ok = true;

    rep(i, 2, n + 1) {
      c.push_back(a[i - 1]);
      d.push_back(b[i - 1]);
      if (!used[i]) {
        if (i * 2 > n) { ok &= a[i - 1] == b[i - 1]; }
        for (int j = i * 2; j <= n; j += i) { used[j] = true; }
      }
    }
    sort(all(c));
    sort(all(d));
    ok &= c == d;
    cout << (ok ? "Yes" : "No") << '\n';
  }

  return 0;
}