A13287 | Infinite Path

You are given a colored permutation $p_1, p_2, \dots, p_n$ . The $i$ -th element of the permutation has color $c_i$ .

Let's define an infinite path as infinite sequence $i, p[i], p[p[i]], p[p[p[i]]] \dots$ where all elements have same color ( $c[i] = c[p[i]] = c[p[p[i]]] = \dots$ ).

We can also define a multiplication of permutations $a$ and $b$ as permutation $c = a \times b$ where $c[i] = b[a[i]]$ . Moreover, we can define a power $k$ of permutation $p$ as $p^k=\underbrace{p \times p \times \dots \times p}_{k \text{ times}}$ .

Find the minimum $k > 0$ such that $p^k$ has at least one infinite path (i.e. there is a position $i$ in $p^k$ such that the sequence starting from $i$ is an infinite path).

It can be proved that the answer always exists.

The first line contains single integer $T$ ( $1 \le T \le 10^4$ ) — the number of test cases.

Next $3T$ lines contain test cases — one per three lines. The first line contains single integer $n$ ( $1 \le n \le 2 \cdot 10^5$ ) — the size of the permutation.

The second line contains $n$ integers $p_1, p_2, \dots, p_n$ ( $1 \le p_i \le n$ , $p_i \neq p_j$ for $i \neq j$ ) — the permutation $p$ .

The third line contains $n$ integers $c_1, c_2, \dots, c_n$ ( $1 \le c_i \le n$ ) — the colors of elements of the permutation.

It is guaranteed that the total sum of $n$ doesn't exceed $2 \cdot 10^5$ .

Print $T$ integers — one per test case. For each test case print minimum $k > 0$ such that $p^k$ has at least one infinite path.