#include<bits/stdc++.h>
using namespace std;
constexpr int Inf = 2000000000;
constexpr long long INF= 2000000000000000000;

template<typename T> inline bool chmax(T &a, T b) { if (a < b) { a = b; return true; } return false; }
template<typename T> inline bool chmin(T &a, T b) { if (a > b) { a = b; return true; } return false; }

template<typename T,typename U>
T modpow(T N, U P, T M = -1) {
    if(P < 0) return 0;
    T ret = 1;
    if(M != -1) ret %= M;
    while(P) {
        if(P & 1) {
            if(M == -1) ret *= N;
            else ret = ret * N % M;
        }
        P /= 2;
        if(M == -1) N *= N;
        else N = N * N % M;
    }
    return ret;
}

constexpr long long MOD = 1000000007;

int main() {
    vector<bool> is_prime(100001,true);
    vector<int> prime;
    is_prime[0] = false;
    is_prime[1] = false;
    for(int i = 2;i < 100001;i++) {
        if(is_prime[i]) {
            prime.push_back(i);
            for(int j = 2;j <= 100000 / i;j++) {
                is_prime[i * j] = false;
            }
        }
    }

    int t;
    cin >> t;
    for(int tmp = 0;tmp < t;tmp++) {
        int n;
        cin >> n;
        vector<int> a(n);
        vector<int> b(n);
        for(auto& x: a) cin >> x;
        for(auto& x: b) cin >> x;
        bool ret = true;
        int itr = upper_bound(prime.begin(),prime.end(),n / 2) - prime.begin();
        int itr2 = upper_bound(prime.begin(),prime.end(),n) - prime.begin();
        if(a[0] != b[0]) ret = false;
        for(int i = itr;i < itr2;i++) {
            if(a[prime[i] - 1] != b[prime[i] - 1]) ret = false;
        }

        sort(a.begin(),a.end());
        sort(b.begin(),b.end());
        for(int i = 0;i < n;i++) {
            if(a[i] != b[i]) ret = false;
        }

        if(ret) cout << "Yes" << endl;
        else cout << "No" << endl;
    }
}