B"Finally, you have defeated Razor and now, you are the Most Wanted street racer. Sergeant Cross has sent the full police force after you in a deadly pursuit. Fortunately, you have found a hiding spot but you fear that Cross and his force will eventually find you. To increase your chances of survival, you want to tune and repaint your BMW M3 GTR. The car can be imagined as a permuted n -dimensional hypercube. A simple n -dimensional hypercube is an undirected unweighted graph built recursively as follows: A permuted n -dimensional hypercube is formed by permuting the vertex numbers of a simple n -dimensional hypercube in any arbitrary manner. Examples of a simple and permuted 3 -dimensional hypercubes are given below: Note that a permuted n -dimensional hypercube has the following properties: Let's denote the permutation used to generate the permuted n -dimensional hypercube, representing your car, from a simple n -dimensional hypercube by P . Before messing up the functionalities of the car, you want to find this permutation so that you can restore the car if anything goes wrong. But the job isn't done yet. You have n different colours numbered from 0 to n-1 . You want to colour the vertices of this permuted n -dimensional hypercube in such a way that for each and every vertex u satisfying 0 <= q u < 2^n and for each and every colour c satisfying 0 <= q c < n , there is at least one vertex v adjacent to u having a colour c . In other words, from each and every vertex, it must be possible to reach a vertex of any colour by just moving to an adjacent vertex. Given the permuted n -dimensional hypercube, find any valid permutation P and colouring. The first line of input contains a single integer t ( 1 <= q t <= q 4096 ) -- the number of test cases. For each test case, the first line contains a single integer n ( 1 <= q n <= q 16"...