B'This is an interactive problem. Initially, there is an array a = [1, 2, ldots, n] , where n is an odd positive integer. The jury has selected frac{n-1}{2} disjoint pairs of elements, and then the elements in those pairs are swapped. For example, if a=[1,2,3,4,5] , and the pairs 1 <= ftrightarrow 4 and 3 <= ftrightarrow 5 are swapped, then the resulting array is [4, 2, 5, 1, 3] . As a result of these swaps, exactly one element will not change position. You need to find this element. To do this, you can ask several queries. In each query, you can pick two integers l and r ( 1 <= q l <= q r <= q n ). In return, you will be given the elements of the subarray [a_l, a_{l + 1}, ... , a_r] sorted in increasing order. Find the element which did not change position. You can make at most mathbf{15} queries. The array a is fixed before the interaction and does not change after your queries. Recall that an array b is a subarray of the array a if b can be obtained from a by deletion of several (possibly, zero or all) elements from the beginning and several (possibly, zero or all) elements from the end. Each test contains multiple test cases. The first line contains an integer t ( 1 <= q t <= q 500 ) -- the number of test cases. The description of the test cases follows. The first line of each test case contains an integer n ( 3 <= q n < 10^4 ; n is odd) -- the length of the array a . After reading the first line of each test case, you should begin the interaction. It is guaranteed that the sum of n over all test cases does not exceed 10^4 . For each test case, begin the interaction by reading the integer n . To make a query, output " texttt{?} ;l ;r " ( 1 <= q l <= q r <= q n ) without quotes. Afterwards, you should read in r-l+1 integers -- the integers a_l, a_{l + 1}, ... , a_r , in increasing '...