#include <iostream>
#include <vector>
#include <cmath>
#include <map>
#include <set>
#include <iomanip>
#include <queue>
#include <algorithm>
#include <numeric>
#include <deque>

using namespace std;
 
struct UnionFind {
    vector<long long> par;
    vector<long long> siz;

    UnionFind(long long N) : par(N), siz(N) {
        for(long long i = 0; i < N; i++){
            par[i] = i;
            siz[i] = 1;
        }   
    }   
 
    long long root(long long x) {
        if (par[x] == x) return x;
        return par[x] = root(par[x]);
    }   
 
    long long unite(long long x, long long y) {
        long long rx = root(x);
        long long ry = root(y);
        if (rx == ry) return rx; 
        if (siz[rx] > siz[ry]) swap(rx, ry);
        par[rx] = ry; 
        siz[ry] += siz[rx];
        return ry; 
    }   
 
    bool same(long long x, long long y) {
        long long rx = root(x);
        long long ry = root(y);
        return rx == ry; 
    }   
 
    long long size(long long x){ 
        return siz[root(x)];
    }   
};

void solve(){
    int N;
    cin >> N;
    vector<int> A(N), B(N);
    multiset<int> st1, st2;
    for (int i=0; i<N; i++){
        cin >> A[i];
        st1.insert(A[i]);
    }
    for (int i=0; i<N; i++){
        cin >> B[i];
        st2.insert(B[i]);
    }
    if (st1 != st2){
        cout << "No" << endl;
        return;
    }

    vector<bool> ok(N+1, 1);
    for (int i=2; i<=N/2; i++){
        for (int j=i; j<=N; j+=i) ok[j] = 0;
    }
    for (int i=1; i<=N; i++){
        if (ok[i]){
            if (A[i-1] != B[i-1]){
                cout << "No" << endl;
                return;
            }
        }
    }
    cout << "Yes" << endl;
    return;
}

int main(){
 
    long long T;
    cin >> T;
    while(T){
        solve();
        T--;
    }
 
    return 0;
}