#include <bits/stdc++.h>
using namespace std;
const int maxn = 2e5 + 10;
const int inf = 0x3f3f3f3f;
int main() {
  int t;
  scanf("%d", &t);
  while (t--) {
    int n;
    scanf("%d", &n);
    vector<long long> e;
    long long cnt = 1;
    while (n) {
      e.push_back(cnt);
      n -= cnt;
      cnt <<= 1;
      if (n < cnt) break;
    }
    if (n) e.push_back(n);
    sort(e.begin(), e.end());
    printf("%d\n", e.size() - 1);
    for (int i = 1; i < e.size(); i++) printf("%lld ", e[i] - e[i - 1]);
    printf("\n");
  }
  return 0;
}
