B"Aquamoon has a Rubik's Square which can be seen as an n x n matrix, the elements of the matrix constitute a permutation of numbers 1, ldots, n^2 . Aquamoon can perform two operations on the matrix: The rows are numbered from 1 to n from top to bottom, the columns are numbered from 1 to n from left to right. The cell at the intersection of the x -th row and the y -th column is denoted as (x, y) . Aquamoon can perform several (possibly, zero) operations, but she has to obey the following restrictions: Aquamoon wonders in how many ways she can transform the Rubik's Square from the given initial state to a given target state. Two ways are considered different if the sequences of applied operations are different. Since the answer can be very large, print the result modulo 998 ,244 ,353 . Each test contains multiple test cases. The first line contains the number of test cases t ( 1 <= t <= 2 cdot 10^4 ). The description of the test cases follows. The first line of each test case contains an integer n ( 3 <= n <= 500 ). The i -th of the following n lines contains n integers a_{i1}, ldots, a_{in} , representing the i -th row of the initial matrix ( 1 <= a_{ij} <= n^2 ). The i -th of the following n lines contains n integers b_{i1}, ldots, b_{in} , representing the i -th row of the target matrix ( 1 <= b_{ij} <= n^2 ). It is guaranteed that both the elements of the initial matrix and the elements of the target matrix constitute a permutation of numbers 1, ldots, n^2 . It is guaranteed that the sum of n^2 over all test cases does not exceed 250 ,000 . For each test case, if it is possible to convert the initial state to the target state respecting all the restrictions, output one integer -- the number of ways to do so, modulo 998 ,244 ,353 . If there is no solution, print a single integer 0"...