B'This is an interactive problem. You are given an integer n . The jury has hidden from you a directed graph with n vertices (numbered from 1 to n ) and some number of edges. You additionally know that: You want to color each vertex in either black or white such that for any two vertices i and j ( 1 <= i < j <= n ) of the same color, vertex i is reachable from vertex j . To do that, you can ask queries of the following type: Find any valid vertex coloring of the hidden graph in at most 2 cdot n queries. It can be proven that such a coloring always exists. Note that the grader is not adaptive: the graph is fixed before any queries are made. ^ dagger Vertex a is reachable from vertex b if there exists a path from vertex b to vertex a in the graph. Each test contains multiple test cases. The first line of input contains a single integer t ( 1 <= t <= 1000 ) -- the number of test cases. The description of the test cases follows. The only line of each test case contains a single integer n ( 3 <= n <= 100 ) -- the number of vertices in the hidden graph. It is guaranteed that the sum of n over all test cases does not exceed 1000 . The interaction for each test case begins by reading the integer n . To make a query, output "? i j" without quotes ( 1 <= i < j <= n ). If vertex i is reachable from vertex j , you will get YES as an answer. Otherwise, you will get NO as an answer. If you receive the integer -1 instead of an answer or a valid value of n , it means your program has made an invalid query, has exceeded the limit of queries, or has given an incorrect answer on the previous test case. Your program must terminate immediately to receive a Wrong Answer verdict. Otherwise, you can get an arbitrary verdict because your solution will continue to read from a closed stream. When you are ready to give the fin'...