Permugame#7324
Ksyusha got a great present for her birthday - a "Permugame". Gear for "Permugame" consists of the two permutations of size : p_i, q_i and a square board n \times n cells. According to the rules cells and are connected to each other by a tunnel if and only if either (a = i and b = p_j) or (a = p_i and b = j). The only goal of the game is to find such a minimal integer (k > 0), that every cell of the board can be painted in one of the colors. The only restriction is that any two connected cells should have different colors. Ksyusha is too lazy to play "Permugame" so she asked you to figure out the answer.
In the first line you are given a single integer (1 \le n \le 100000) - size of the board and permutations and . In the next line permutation p_i (1 \le p_i \le n) is given as a list of integers separated by spaces. In the third line permutation q_i (1 \le q_i \le n) is given in the same format. It is guaranteed that p_i \neq i and q_i \neq i for each in .
Print the minimal integer (k > 0) such that every cell of the n \times n board can be painted in one of the colors.
Example 1
Example 2
Example 3