B'You are given an integer x . Your task is to reduce x to 1 . To do that, you can do the following operation: There is an additional constraint: you cannot select the same value of d more than twice. For example, for x=5 , the following scheme is invalid because 1 is selected more than twice: 5 xrightarrow{-1}4 xrightarrow{-1}3 xrightarrow{-1}2 xrightarrow{-1}1 . The following scheme is however a valid one: 5 xrightarrow{-1}4 xrightarrow{-2}2 xrightarrow{-1}1 . Output any scheme which reduces x to 1 with at most 1000 operations. It can be proved that such a scheme always exists. Each test contains multiple test cases. The first line contains the number of test cases t ( 1 <= t <= 1000 ). The description of the test cases follows. The only line of each test case contains a single integer x ( 2 <= x <= 10^{9} ). For each test case, output two lines. The first line should contain an integer k ( 1 <= k <= 1001 ). The next line should contain k integers a_1,a_2, ldots,a_k , which satisfy the following: In the first test case, we use the following scheme: 3 xrightarrow{-1}2 xrightarrow{-1}1 . In the second test case, we use the following scheme: 5 xrightarrow{-1}4 xrightarrow{-2}2 xrightarrow{-1}1 . In the third test case, we use the following scheme: 14 xrightarrow{-2}12 xrightarrow{-6}6 xrightarrow{-3}3 xrightarrow{-1}2 xrightarrow{-1}1 . '...