B'You are given two arrays of integers a_1, a_2, ldots, a_n and b_1, b_2, ldots, b_n . Let 's define a transformation of the array a : Is it possible to perform some transformation of the array a exactly once, so that the resulting array is equal to b ? The first line contains a single integer t ( 1 <= t <= 100 ) -- the number of test cases. Descriptions of test cases follow. The first line of each test case contains a single integer n ( 1 <= n <= 100 ) -- the size of arrays a and b . The second line of each test case contains n integers a_1, a_2, ldots, a_n ( -100 <= a_i <= 100 ). The third line of each test case contains n integers b_1, b_2, ldots, b_n ( -100 <= b_i <= 100 ). For each test case, print "YES" (without quotes) if it is possible to perform a transformation of the array a , so that the resulting array is equal to b . Print "NO" (without quotes) otherwise. You can print each letter in any case (upper or lower). In the first test case, we can make the following transformation: In the second test case there is no suitable transformation. In the third test case we choose k = 0 and do not change the order of elements. '...