from itertools import chain
import sys
input = sys.stdin.buffer.readline
sys.setrecursionlimit(10 ** 7)
U = 1 << 20


def prime_set(N):
    """
    Nまでの素数のsetを返す
    """
    if N < 4:
        return ({}, {}, {2}, {2, 3})[N]
    Nsq = int(N ** 0.5 + 0.5) + 1
    primes = {2, 3} | set(chain(range(5, N + 1, 6), range(7, N + 1, 6)))
    for i in range(5, Nsq, 2):
        if i in primes:
            primes -= set(range(i * i, N + 1, i * 2))
    return primes


class UF_tree:
    def __init__(self, n):
        self.root = [-1] * (n + 1)
        self.rank = [0] * (n + 1)

    def find(self, x):
        stack = []
        while self.root[x] >= 0:
            stack.append(x)
            x = self.root[x]
        for i in stack:
            self.root[i] = x
        return x

    def same(self, x, y):
        return self.find(x) == self.find(y)

    def unite(self, x, y):
        x = self.find(x)
        y = self.find(y)
        if x == y:
            return False
        if self.rank[x] < self.rank[y]:
            self.root[y] += self.root[x]
            self.root[x] = y
        else:
            self.root[x] += self.root[y]
            self.root[y] = x
            if self.rank[x] == self.rank[y]:
                self.rank[x] += 1
        return True

    def size(self, x):
        return -self.root[self.find(x)]


T = int(input())
P = sorted(prime_set(U))

for _ in range(T):
    N = int(input())
    A = list(map(int, input().split()))
    B = list(map(int, input().split()))
    uf = UF_tree(N)
    for p in P:
        if p > N:
            break
        for i in range(p + p, N+1, p):
            uf.unite(p-1, i-1)
    gA = [[] for _ in range(N)]
    gB = [[] for _ in range(N)]
    for i in range(N):
        gA[uf.find(i)].append(A[i])
        gB[uf.find(i)].append(B[i])

    ok = True
    for i in range(N):
        gA[i].sort()
        gB[i].sort()
        if gA[i] != gB[i]:
            ok = False
            break
    if ok:
        print("Yes")
    else:
        print("No")