B'Given an integer n , you construct an array a of n integers, where a_i = i for all integers i in the range [1, n] . An operation on this array is defined as follows: After all the operations a_i <= 10^{18} should hold for all 1 <= i <= n . We can show that an answer always exists. The first line contains one integer t ( 1 <= t <= 10^2 ) -- the number of test cases. The description of the test cases follows. The first and only line of each test case contains an integer n ( 3 <= q n <= q 3 cdot 10^{4} ) -- the length of the array. It is guaranteed that the sum of n over all test cases does not exceed 3 cdot 10^{4} . The first line should contain an integer k ( 0 <= q k <= q lfloor frac{n}{6} rfloor + 5 ) -- where k is the number of operations. The next k lines should contain the description of each operation i.e. 3 integers i , j and k , where 1 <= q i, j, k <= q n and all must be distinct. In the third test case, a = [1, 2, 3, 4, 5, 6, 7] . First operation: i = 3 , j = 5 , k = 7 x = 3 , y = 5 , z = 7 . a = [1, 2, operatorname{lcm}(y,z), 4, operatorname{lcm}(x,z), 6, operatorname{lcm}(x,y)] = [1, 2, color{red}{35}, 4, color{red}{21}, 6, color{red}{15}] . Second operation: i = 5 , j = 6 , k = 7 x = 21 , y = 6 , z = 15 . a = [1, 2, 35, 4, operatorname{lcm}(y,z), operatorname{lcm}(x,z), operatorname{lcm}(x,y)] = [1, 2, 35, 4, color{red}{30}, color{red}{105}, color{red}{42}] . Third operation: i = 2 , j = 3 , k = 4 x = 2 , y = 35 , z = 4 . a = [1, operatorname{lcm}(y,z), operatorname{lcm}(x,z), operatorname{lcm}(x,y), 30, 105, 42] = [1, color{red}{140}, color{red}{4}, color{red}{70}, 30, 105, 42] . Subsequences whose GCD equal to i is as follows: gcd(a_1, a_2) = gcd'...