This is an interactive problem. You are given an integer (n). There is a hidden array (a) of length (2n). Each integer from (1) to (n) appears exactly once in (a). The rest of the elements are all (0). You can make the following type of query: Choose two integers (i) and (j) ((1 \le i,j \le 2n), (i \ne j)). The judge will respond with (1) if (a_i=a_j), and will respond with (0) otherwise. Find any integer (k) ((1 \le k \le 2n)) such that (a_k=0) in no more than (n+1) queries. Note that the interactor is adaptive , which means that the hidden array (a) may change depending on your queries but will not contradict previous queries. Each test contains multiple test cases. The first line contains the number of test cases (t) ((1 \le t \le 10^3)). The description of the test cases follows. The first line of each test case contains an integer (n) ((2 \le n \le 10^4)). The length of the hidden array (a) will be (2n). It is guaranteed that the sum of (n) over all test cases does not exceed (10^4). To make a query, output a line in the following format: (?\;i\;j) ((1 \le i,j \le 2n), (i \ne j)) As a response to the query, you will get: (1) if (a_i=a_j); (0) if (a_i \ne a_j); (-1) if you made an invalid query or if you exceed the limit of (n+1) queries. To report the answer, output a line in the following format: (!\;k) ((1 \le k \le 2n)) After this, proceed to the next test case or terminate if this is the last test case. Note that reporting the answer does not count towards the (n+1) queries. The interactor is adaptive . This means that the hidden array (a) may change depending on your queries but will not contradict previous queries. After printing each query do not forget to output the end of line and flush(^{\text{∗}}) the output. Otherwise, you will get Idleness limit exceeded verdi