Given two arrays of distinct positive integers (a) and (b) of length (n), we would like to make both the arrays the same. Two arrays (x) and (y) of length (k) are said to be the same when for all (1 \le i \le k), (x_i = y_i). Now in one move, you can choose some index (l) and (r) in (a) ((l \le r)) and swap (a_l) and (a_r), then choose some (p) and (q) ((p \le q)) in (b) such that (r-l=q-p) and swap (b_p) and (b_q). Is it possible to make both arrays the same? Each test contains multiple test cases. The first line contains the number of test cases (t) ((1 \le t \le 2 \cdot 10^4)). The description of the test cases follows. The first line of each test case contains a single integer (n) ((1 \le n \le 10^5)) — the length of the arrays (a) and (b). The second line of each test case contains (n) distinct integers (a_1,a_2,a_3,\ldots,a_n) ((1 \le a_i \le 2 \cdot 10^5)) — the integers in the array (a). The third line of each test case contains (n) distinct integers (b_1,b_2,b_3,\ldots,b_n) ((1 \le b_i \le 2 \cdot 10^5)) — the integers in the array (b). It is guaranteed that the sum of (n) over all test cases does not exceed (10^5). For each testcase, print " YES " if the arrays (a) and (b) can be made the same. Otherwise, print " NO ". can output the answer in any case (upper or lower). For example, the strings " yEs ", " yes ", " Yes ", and " YES " will be recognized as positive responses. In the first testcase, you don't need to perform any operations since the arrays are same. In the second testcase, it can be proven there exists no way to make the arrays same. In the third testcase, one of the ways to make the arrays same is to first choose (l=1), (r=3), (p=1), (q=3) then choose (l=1), (r=2), (p=3), (q=4).