B"A sequence of n numbers is called permutation if it contains all numbers from 1 to n exactly once. For example, the sequences [3, 1, 4, 2] , [ 1 ] and [2,1] are permutations, but [1,2,1] , [0,1] and [1,3,4] are not. For a given number n you need to make a permutation p such that two requirements are satisfied at the same time: Let's call the permutation that satisfies these requirements funny. For example, let n = 4 . Then [ 4, 3, 1, 2 ] is a funny permutation, since: For a given positive integer n , output any funny permutation of length n , or output -1 if funny permutation of length n does not exist. The first line of input data contains a single integer t ( 1 <= t <= 10^4 ) -- the number of test cases. The description of the test cases follows. Each test case consists of f single line containing one integer n ( 2 <= n <= 2 cdot 10^5 ). It is guaranteed that the sum of n over all test cases does not exceed 2 cdot 10^5 . For each test case, print on a separate line: The first test case is explained in the problem statement. In the second test case, it is not possible to make the required permutation: permutations [1, 2, 3] , [1, 3, 2] , [2, 1, 3] , [3, 2, 1] have fixed points, and in [2, 3, 1] and [3, 1, 2] the first condition is met not for all positions. "...