This is an interactive problem. While procrastinating at work, Dilhan the elf stumbled upon two arrays (a) and (b). Initially, both of them consist of a single integer (2^k) (i.e., (a=b=2^k)), where (k) is a non-negative integer. Dilhan then applied the following two types of operations an arbitrary number of times (possibly zero), in any order: Flatten — Choose either (a) or (b), and select any element (x) that is maximal within that array ((x) does not need to be maximal in the other array). Then, replace (x) with two copies of (\frac x2) in the same position. This operation can only be applied if (x) is even. Concatenate — Set both (a) and (b) to be (a+b), where (+) denotes array concatenation. After performing these operations, Dilhan discards (b), hides (a) from you, and challenges you to a game. Let (n) be the length of the hidden array (a). You may make the following query: Choose an interval (l, r) ((1\le l\le r\le n)), and Dilhan will tell you the sum (a_l+a_{l+1}+\cdots+a_r). Determine the value of the maximum element of (a) by making at most (300) queries. Each test contains multiple test cases. The first line contains the number of test cases (t) ((1 \le t \le 100)). The description of the test cases follows. The first line of each test case contains a single integer (n) ((1 \le n \le 10^5)) — the length of (a). It is guaranteed that (1\le a_i\le 2^{30}), and the array (a) can be generated by the process described in the statements. It is guaranteed that the sum of (n) over all test cases does not exceed (10^5). For each test case, you are first given an integer (n) — the length of the hidden array (a). You may then make up to (300) queries. To make a query, print a line in the following format: (?\;l\;r) ((1\le l\le r\le n)) — the indices chosen for the query. After you print a