Problem: Phoenix has decided to become a scientist! He is currently investigating the growth of bacteria.

Initially, on day 1, there is one bacterium with mass 1.

Every day, some number of bacteria will split (possibly zero or all). When a bacterium of mass m splits, it becomes two bacteria of mass m/2 each. For example, a bacterium of mass 3 can split into two bacteria of mass 1.5.

Also, every night, the mass of every bacteria will increase by one.

Phoenix is wondering if it is possible for the total mass of all the bacteria to be exactly n. If it is possible, he is interested in the way to obtain that mass using the minimum possible number of nights. Help him become the best scientist!

Input

The input consists of multiple test cases. The first line contains an integer t (1 ≤ t ≤ 1000) — the number of test cases.

The first line of each test case contains an integer n (2 ≤ n ≤ 10^9) — the sum of bacteria masses that Phoenix is interested in. 

Output

For each test case, if there is no way for the bacteria to exactly achieve total mass n, print -1. Otherwise, print two lines.

The first line should contain an integer d — the minimum number of nights needed.

The next line should contain d integers, with the i-th integer representing the number of bacteria that should split on the i-th day.

If there are multiple solutions, print any.

Example

Input


3
9
11
2


Output


3
1 0 2 
3
1 1 2
1
0 

Note

In the first test case, the following process results in bacteria with total mass 9: 

  * Day 1: The bacterium with mass 1 splits. There are now two bacteria with mass 0.5 each. 
  * Night 1: All bacteria's mass increases by one. There are now two bacteria with mass 1.5. 
  * Day 2: None split. 
  * Night 2: There are now two bacteria with mass 2.5. 
  * Day 3: Both bacteria split. There are now four bacteria with mass 1.25. 
  * Night 3: There are now four bacteria with mass 2.25. 

The total mass is 2.25+2.25+2.25+2.25=9. It can be proved that 3 is the minimum number of nights needed. There are also other ways to obtain total mass 9 in 3 nights.

 

In the second test case, the following process results in bacteria with total mass 11: 

  * Day 1: The bacterium with mass 1 splits. There are now two bacteria with mass 0.5. 
  * Night 1: There are now two bacteria with mass 1.5. 
  * Day 2: One bacterium splits. There are now three bacteria with masses 0.75, 0.75, and 1.5. 
  * Night 2: There are now three bacteria with masses 1.75, 1.75, and 2.5. 
  * Day 3: The bacteria with mass 1.75 and the bacteria with mass 2.5 split. There are now five bacteria with masses 0.875, 0.875, 1.25, 1.25, and 1.75. 
  * Night 3: There are now five bacteria with masses 1.875, 1.875, 2.25, 2.25, and 2.75. 

The total mass is 1.875+1.875+2.25+2.25+2.75=11. It can be proved that 3 is the minimum number of nights needed. There are also other ways to obtain total mass 11 in 3 nights.

 

In the third test case, the bacterium does not split on day 1, and then grows to mass 2 during night 1.

Solution (in PYTHON3):

Solution:
from sys import setrecursionlimit
from collections import deque
import heapq
import functools
# setrecursionlimit(10**6)
def IntInput(): return int(input())
def M_IntInput(): return map(int,input().split())
def M_StrInput(): return map(int,input().split())
def IntArrayInput(): return list(map(int,input().split()))
def modInverse(p,a,m): return ((p%m)*pow(a%m,m-2,m))%m
def compare(item1, item2): return item2[0] - item1[0] if item1[0]!=item2[0] else item1[1] - item2[1]
def DFS(s,n,paths,answer):
    visited = [False] * (n+1)
    stack = []
    stack.append(s) 
    visited[s] = True
    DFSArray = []
    while stack: 
        s = stack.pop()
        DFSArray.append(s)
        flag = 0
        for i in paths[s]: 
            if visited[i] == False: 
                flag=1
                stack.append(i) 
                visited[i] = True
    
        if not flag:
            answer[s-1][1]=0
    
    while DFSArray!=[]:
        s = DFSArray.pop()
        if answer[s-1][1]<0:
            answer[s-1][1] = 0
            for i in paths[s]:
                if answer[i-1][1]>=0:
                    answer[s-1][1] += answer[i-1][1]+1

    return answer
def BFS(s,n,paths,answer): 
    visited = [False] * (n+1)
    answer[s-1][0] = 0
    queue = deque()
    queue.append(s) 
    visited[s] = True
    while queue: 
        s = deque.popleft(queue)
        for i in paths[s]: 
            if visited[i] == False: 
                queue.append(i) 
                answer[i-1][0] = answer[s-1][0] + 1
                visited[i] = True
    return answer
numbers = ["1110111", "0010010", "1011101", "1011011", "0111010", "1101011", "1101111", "1010010", "1111111", "1111011"]
Dict_Numbers = {"1110111":0, "0010010":1, "1011101":2, "1011011":3, "0111010":4, "1101011":5, "1101111":6, "1010010":7, "1111111":8, "1111011":9}
# ----------------------- Anshul Raj ------------------------ #

for _ in range(int(input())):
    n = int(input()) 
    array = [1]
    sumV = 1
    while(sumV!=n):
        # print(array)
        if sumV+(2*array[-1])<=n:
            sumV+=array[-1]*2
            array.append(2*array[-1])
        else:
            array.append(n-sumV)
            sumV = n
            
    array.sort()
    # print(n,array)
    ans = []
    for i in range(1,len(array)):
        ans.append(str(array[i]-array[i-1]))
    
    print(len(array)-1)
    print(" ".join(ans))