// clang-format off #include <bits/stdc++.h> using namespace std; using ll = long long; using ld = long double; template<class T> using V = vector<T>; using VI = V<int>; using VL = V<ll>; using VS = V<string>; template<class T> using PQ = priority_queue<T, V<T>, greater<T>>; using graph = V<VI>; template<class T> using w_graph = V<V<pair<int, T>>>; #define FOR(i,a,n) for(int i=(a);i<(n);++i) #define eFOR(i,a,n) for(int i=(a);i<=(n);++i) #define rFOR(i,a,n) for(int i=(n)-1;i>=(a);--i) #define erFOR(i,a,n) for(int i=(n);i>=(a);--i) #define all(a) a.begin(),a.end() #define rall(a) a.rbegin(),a.rend() #define inside(h,w,y,x) (unsigned(y)<h&&unsigned(x)<w) #ifndef ONLINE_JUDGE #define line cout << "-----------------------------\n" #define stop system("pause") #endif constexpr ll INF = 1000000000; constexpr ll LLINF = 1LL << 61; constexpr ll mod = 1000000007; constexpr ll MOD = 998244353; constexpr ld eps = 1e-10; constexpr int dy[]{ -1,0,1,0 }, dx[]{ 0,1,0,-1 }; template<class T> inline bool chmax(T& a, const T& b) { if (a < b) { a = b; return true; }return false; } template<class T> inline bool chmin(T& a, const T& b) { if (a > b) { a = b; return true; }return false; } inline void init() { cin.tie(nullptr); cout.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(15); } template<class T> inline istream& operator>>(istream& is, V<T>& v) { for (auto& a : v)is >> a; return is; } template<class T, class U> inline istream& operator>>(istream& is, pair<T, U>& p) { is >> p.first >> p.second; return is; } template<class T> inline V<T> vec(size_t a) { return V<T>(a); } template<class T> inline V<T> defvec(T def, size_t a) { return V<T>(a, def); } template<class T, class... Ts> inline auto vec(size_t a, Ts... ts) { return V<decltype(vec<T>(ts...))>(a, vec<T>(ts...)); } template<class T, class... Ts> inline auto defvec(T def, size_t a, Ts... ts) { return V<decltype(defvec<T>(def, ts...))>(a, defvec<T>(def, ts...)); } template<class T> inline void print(const T& a) { cout << a << "\n"; } template<class T, class... Ts> inline void print(const T& a, const Ts&... ts) { cout << a << " "; print(ts...); } template<class T> inline void print(const V<T>& v) { for (int i = 0; i < v.size(); ++i)cout << v[i] << (i == v.size() - 1 ? "\n" : " "); } template<class T> inline void print(const V<V<T>>& v) { for (auto& a : v)print(a); } template<class T> inline constexpr const T cumsum(const V<T>& a, int l, int r) { return 0 <= l && l <= r && r < a.size() ? a[r] - (l == 0 ? 0 : a[l - 1]) : 0; }//[l,r] template<class T> inline constexpr const T min(const V<T>& v) { return *min_element(all(v)); } template<class T> inline constexpr const T max(const V<T>& v) { return *max_element(all(v)); } // clang-format on class UnionFind { VI par, rank; int forest_num; public: UnionFind(const int& n) : par(n), rank(n, 1), forest_num(n) { FOR(i, 0, n) par[i] = i; } int root(int x) { if (par[x] == x) return x; return par[x] = root(par[x]); } int size(int x) { if (par[x] == x) return rank[x]; return size(par[x]); } void unite(int x, int y) { int rx = root(x), ry = root(y); if (rx == ry) return; if (rank[rx] < rank[ry]) { par[rx] = ry; rank[ry] += rank[rx]; } else { par[ry] = rx; rank[rx] += rank[ry]; } --forest_num; } bool same(int x, int y) { return root(x) == root(y); } int fnum() { return forest_num; } }; void solve() { int n; cin >> n; UnionFind uf(n + 1); eFOR(i, 2, n) for (int j = i * 2; j <= n; j += i) uf.unite(i, j); V<VI> a(n + 1), b(n + 1); eFOR(i, 1, n) { int x; cin >> x; a[uf.root(i)].push_back(x); } eFOR(i, 1, n) { int y; cin >> y; b[uf.root(i)].push_back(y); } rFOR(i, 1, n) { sort(all(a[i])); sort(all(b[i])); if (a[i] != b[i]) { print("No"); return; } } print("Yes"); } int main() { init(); int t; cin >> t; while (t--) solve(); return 0; }