#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
using ll = long long;
using mint = modint998244353;
using vi = vector<int>;
using vvi = vector<vi>;
using vvvi = vector<vvi>;
using vll = vector<ll>;
using vvll = vector<vll>;
using vvvll = vector<vvll>;
using vmi = vector<mint>;
using vvmi = vector<vmi>;
using vvvmi = vector<vvmi>;
#define all(a) (a).begin(), (a).end()
#define rep2(i, m, n) for (int i = (m); i < (n); ++i)
#define rep(i, n) rep2(i, 0, n)
#define drep2(i, m, n) for (int i = (m)-1; i >= (n); --i)
#define drep(i, n) drep2(i, n, 0)
class Primes{
    private:
        int size_p;
        vector<bool> is_p;
        vector<int> primes;
        vector<int> minfactor;
        vector<int> mobius;
        void eratos(int n){
            for(int i=2; i<=n; i++){
                if(minfactor[i] < i)continue;
                primes.emplace_back(i);
                mobius[i] = -1;
                is_p[i] =true;
                for(int j = 2*i; j<=n; j+=i){
                    minfactor[j] = min(i, minfactor[j]);
                    mobius[j] = ((j/i) % i == 0) ? 0 : -mobius[j];
                }
            }
        }
        
    public:
        Primes(int n){
            size_p = n;
            rep(i, size_p+1)is_p.emplace_back(false);
            rep(i, size_p+1)minfactor.emplace_back(i);
            rep(i, size_p+1)mobius.push_back(1);
            mobius[1] = 1;
            eratos(size_p);
            
        }

        bool isprime(int n){
            return is_p[n];
        }
        vector<int> listPrimes(){
            return primes;
        }
        int getMobius(int n){return mobius[n];}

};

Primes pr(100020);
vi vp = pr.listPrimes();
set<int> st;

void solve(){
    int n; cin >> n;
    vi a(n), b(n);
    rep(i, n)cin >> a[i];
    rep(i, n)cin >> b[i];
    bool f = true;
    rep(i, n)f = f && (a[i] == b[i]);
    if(f){
        cout << "Yes" << endl;
        return;
    }
    vi c(n), d(n); rep(i, n)c[i] = a[i]; rep(i, n)d[i] = b[i];
    sort(all(c)); sort(all(d));
    f = true;
    rep(i, n)f = f &&(c[i] == d[i]);
    if(!f){
        cout << "No" << endl;
        return;
    }
    if(a[0] != b[0]){
        cout << "No" << endl;
        return;
    }
    rep2(i, 1, n){
        if(i%2 != 0)continue;
        if(!st.count(i+1))continue;
        if(2*(i+1) <= n)continue;
        if(a[i]!=b[i]){
            cout << "No" << endl;
            return;
        }
    }
    cout << "Yes" << endl;
}

int main(){
    for(auto i : vp)st.insert(i);
    int t; cin >> t;
    while(t--)solve();

    return 0;
}