B'You are given two arrays a_1, a_2, ldots, a_n and b_1, b_2, ldots, b_n . In one operation, you can choose any integer i from 1 to n and swap the numbers a_i and b_i . Determine whether, after using any (possibly zero) number of operations, the following two conditions can be satisfied simultaneously: Here max(c_1, c_2, ldots, c_k) denotes the maximum number among c_1, c_2, ldots, c_k . For example, max(3, 5, 4) = 5 , max(1, 7, 7) = 7 , max(6, 2) = 6 . Each test contains multiple test cases. The first line contains the number of test cases t ( 1 <= t <= 200 ). The description of the test cases follows. The first line of each test case contains a single integer n ( 1 <= n <= 100 ) -- the length of the arrays. The second line of each test case contains n integers a_1, a_2, ldots, a_n ( 1 <= a_i <= 100 ) -- elements of the first array. The third line of each test case contains n integers b_1, b_2, ldots, b_n ( 1 <= b_i <= 100 ) -- elements of the second array. For each test case, print "Yes" if after using any (possibly zero) number of operations the conditions described above are satisfied. Otherwise, print "No". You 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 test case, you can swap the numbers a_3 and b_3 , after which the array a becomes equal to [7, 9, 9] , and the array b becomes equal to [7, 6, 7] , and both conditions are met. In the second test case, it can be proved that it is impossible to satisfy both conditions. In the third test case, you can swap the numbers a_1 and b_1 , after which the array a becomes equal to [99, 99] , and the array b becomes equal to [100, 100] , and both conditions are satisfied. In fifth test case, yo'...