B'This is an interactive problem. Jury initially had a sequence a of length n , such that a_i = i . The jury chose three integers i , j , k , such that 1 <= q i < j < k <= q n , j - i > 1 . After that, Jury reversed subsegments [i, j - 1] and [j, k] of the sequence a . Reversing a subsegment [l, r] of the sequence a means reversing the order of elements a_l, a_{l+1}, ldots, a_r in the sequence, i. e. a_l is swapped with a_r , a_{l+1} is swapped with a_{r-1} , etc. You are given the number n and you should find i , j , k after asking some questions. In one question you can choose two integers l and r ( 1 <= q l <= q r <= q n ) and ask the number of inversions on the subsegment [l, r] of the sequence a . You will be given the number of pairs (i, j) such that l <= q i < j <= q r , and a_i > a_j . Find the chosen numbers i , j , k after at most 40 questions. The numbers i , j , and k are fixed before the start of your program and do not depend on your queries. Each test consists of multiple test cases. The first line contains a single integer t ( 1 <= q t <= q 100 ) -- the number of test cases. Description of the test cases follows. The single line of each test case contains a single integer n ( 4 <= q n <= q 10^9 ). After reading it you should start an interaction process by asking questions for that test case. After giving an answer you should: To ask number of inversions on a subsegment [l, r] , print "? l r", where ( 1 <= q l <= q r <= q n ). You can ask at most 40 questions in each test case. As a result you should read a single integer x . To give the answer, print "! i j k", where i , j , k are the numbers you found. You should continue solving the next test cases or terminate the program after that.'...