#include <bits/stdc++.h>
using namespace std;
int main(){
  int T;
  cin >> T;
  for (int i = 0; i < T; i++){
    int N;
    cin >> N;
    vector<int> A(N);
    for (int j = 0; j < N; j++){
      cin >> A[j];
    }
    vector<int> B(N);
    for (int j = 0; j < N; j++){
      cin >> B[j];
    }
    vector<vector<int>> E(N);
    for (int j = 2; j <= N; j++){
      for (int k = j * 2; k <= N; k += j){
        E[j - 1].push_back(k - 1);
        E[k - 1].push_back(j - 1);
      }
    }
    vector<bool> used(N, false);
    bool ok = true;
    for (int j = 0; j < N; j++){
      if (!used[j]){
        used[j] = true;
        vector<int> a, b;
        queue<int> Q;
        Q.push(j);
        while (!Q.empty()){
          int v = Q.front();
          Q.pop();
          a.push_back(A[v]);
          b.push_back(B[v]);
          for (int w : E[v]){
            if (!used[w]){
              used[w] = true;
              Q.push(w);
            }
          }
        }
        sort(a.begin(), a.end());
        sort(b.begin(), b.end());
        if (a != b){
          ok = false;
        }
      }
    }
    if (ok){
      cout << "Yes" << endl;
    } else {
      cout << "No" << endl;
    }
  }
}