#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;
[[maybe_unused]] constexpr int INF = 0x3f3f3f3f;
[[maybe_unused]] constexpr long long INFL = 0x3f3f3f3f3f3f3f3fLL;

class disjoint_set {
public:
  disjoint_set() = default;
  explicit disjoint_set(int n) : par(n, -1) {}
  void merge(int x, int y) {
    x = root(x);
    y = root(y);
    if (x == y) { return; }
    if (par[x] > par[y]) { std::swap(x, y); };
    par[x] += par[y];
    par[y] = x;
  }
  bool same(int x, int y) { return root(x) == root(y); }
  int root(int x) {
    if (par[x] < 0) { return x; }
    return par[x] = root(par[x]);
  }
  int sizeOf(int x) { return -par[root(x)]; }

private:
  std::vector<int> par;
};

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;
    disjoint_set ds(n + 1);
    if (a[0] != b[0]) {
      cout << "No" << '\n';
      continue;
    }
    vector<bool> used(n);
    rep(i, 2, n + 1) {
      if (!used[i]) {
        for (int j = i * 2; j <= n; j += i) {
          used[j] = true;
          ds.merge(i, j);
        }
      }
    }
    map<int, vector<int>> mp0, mp1;
    rep(i, 2, n + 1) {
      mp0[ds.root(i)].push_back(a[i - 1]);
      mp1[ds.root(i)].push_back(b[i - 1]);
    }
    bool ok = true;
    for (auto &&[x, y] : mp0) {
      sort(all(y));
      sort(all(mp1[x]));
      ok &= mp1[x] == y;
    }
    cout << (ok ? "Yes" : "No") << '\n';
  }

  return 0;
}