/* -*- coding: utf-8 -*-
 *
 * 1779.cc:  No.1779 Magical Swap - yukicoder
 */

#include<cstdio>
#include<vector>
#include<algorithm>
 
using namespace std;

/* constant */

const int MAX_N = 100000;

/* typedef */

typedef vector<int> vi;

/* global variables */

int as[MAX_N + 1], bs[MAX_N + 1];
bool used[MAX_N + 1];

/* subroutines */

void printvi(vi &v) {
  for (auto u: v) printf("%d ", u);
}

/* main */

int main() {
  int tn;
  scanf("%d", &tn);

  while (tn--) {
    int n;
    scanf("%d", &n);
    for (int i = 1; i <= n; i++) scanf("%d", as + i);
    for (int i = 1; i <= n; i++) scanf("%d", bs + i);

    fill(used, used + n + 1, false);

    for (int u = 2; u <= n; u++)
      if (! used[u] && u * 2 <= n)
	for (int v = u; v <= n; v += u) used[v] = true;

    bool ok = true;
    vi va, vb;
    for (int u = 1; ok && u <= n; u++) {
      if (used[u]) va.push_back(as[u]), vb.push_back(bs[u]);
      else ok = (as[u] == bs[u]);
    }
    sort(va.begin(), va.end());
    sort(vb.begin(), vb.end());
    //printvi(va), printf("<=> "), printvi(vb), putchar('\n');

    if (ok && va == vb) puts("Yes");
    else puts("No");
  }
  return 0;
}