This is an interactive problem. The pink soldiers hid from you (n) ((3 \le n \le 1500)) fixed points ((x_1,y_1), (x_2,y_2), \ldots, (x_n,y_n)), whose coordinates are not given to you . Also, it is known that no two points have the same coordinates, and no three points are collinear . You can ask the Frontman about three distinct indices (i), (j), (k). Then, he will draw a triangle with points ((x_i,y_i)), ((x_j,y_j)), ((x_k,y_k)), and respond with the following: If at least one of the hidden points lies inside the triangle, then the Frontman gives you the index of one such point. Do note that if there are multiple such points, the Frontman can arbitrarily select one of them . Otherwise, the Frontman responds with (0). Using at most (\mathbf{75}) queries, you must find any triangle formed by three of the points, not containing any other hidden point inside. Do note that the Frontman may be adaptive while choosing the point to give you. In other words, the choice of the point can be determined by various factors including but not limited to the orientation of points and the previous queries. However, note that the sequence of points will never be altered . Hacks are disabled for this problem. Your solution will be judged on exactly (\mathbf{35}) input files, including the example input. Each test contains multiple test cases. The first line contains the number of test cases (t) ((1 \le t \le 20)). The description of the test cases follows. The first line of each test case contains one positive integer (n) — the number of points ((3 \le n \le 1500)). Afterwards, you can output the following on a separate line to ask a query: " ? i j k " ((1 \le i,j,k \le n), (i \ne j), (i \ne k), (j \ne k)): Ask about the triangle formed by ((x_i,y_i)), ((x_j,y_j)), ((x_k,y_k)). Then, the interactor responds with one integer on a new line: If your query is invalid or the number of quer