You are given two arrays of positive integers (a) and (b), both of length (n). You will perform the following operation exactly (n - 1) times: let (m) be the current length of (a) and (b), note that the lengths will always be equal. select an integer (i) ((1 \le i \lt m)): let (S) be the multiset (\{a_i, a_{i + 1}, b_i, b_{i + 1}\}) sort the elements of (S) such that (s_1 \le s_2 \le s_3 \le s_4). now replace (a_i, a_{i + 1}) with (s_2) and (b_i, b_{i + 1}) with (s_3). More formally, replace (a) with (a_1,a_2,\ldots,a_{i - 1},s_2,a_{i + 2},\ldots,a_m), and replace (b) with (b_1,b_2,\ldots,b_{i - 1},s_3,b_{i + 2},\ldots,b_m). let (S) be the multiset (\{a_i, a_{i + 1}, b_i, b_{i + 1}\}) sort the elements of (S) such that (s_1 \le s_2 \le s_3 \le s_4). now replace (a_i, a_{i + 1}) with (s_2) and (b_i, b_{i + 1}) with (s_3). More formally, replace (a) with (a_1,a_2,\ldots,a_{i - 1},s_2,a_{i + 2},\ldots,a_m), and replace (b) with (b_1,b_2,\ldots,b_{i - 1},s_3,b_{i + 2},\ldots,b_m). After performing all operations, there will be exactly (1) element remaining in both (a) and (b). Determine the maximum value of (\min(a_1, b_1)) attainable if you perform operations optimally. Each test contains multiple test cases. The first line contains the number of test cases (t) ((1 \le t \le 10^4)). The description of the test cases follows. The first line of each testcase contains an integer (n) ((1 \le n \le 10^5)) — the length of the arrays (a) and (b). The second line of each testcase contains (n) integers (a_1,a_2,\ldots,a_{n}) ((1 \le a_i \le 2 \cdot n)). The third line of each testcase contains (n) integers (b_1,b_2,\ldots,b_{n}) ((1 \le b_i \le 2 \cdot n)). It is guaranteed that the sum of (n) over all test cases does not exceed (10^5). For each testcase, outp