#include <bits/stdc++.h>
#pragma optimise GCC(-O2)
using namespace std;
mt19937_64 rang(
    chrono::high_resolution_clock::now().time_since_epoch().count());
int rng(int lim) {
  uniform_int_distribution<int> uid(0, lim - 1);
  return uid(rang);
}
long long INF = LLONG_MAX;
const long long M = 1000000007;
long long powm(long long, long long);
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  long long t;
  cin >> t;
  while (t--) {
    long long n;
    cin >> n;
    long long curr = 1;
    vector<long long> hmm;
    long long tp = 0;
    while (1) {
      tp += curr;
      if (tp > n) break;
      hmm.push_back(curr);
      curr <<= 1;
    }
    if (n - tp + curr) hmm.push_back(n - tp + curr);
    sort(hmm.begin(), hmm.end());
    cout << hmm.size() - 1 << endl;
    for (int i = 1; i < hmm.size(); i++) cout << hmm[i] - hmm[i - 1] << " ";
    cout << endl;
  }
}
long long powm(long long a, long long b) {
  long long res = 1;
  while (b) {
    if (b & 1) res = (res * a) % M;
    a = (a * a) % M;
    b >>= 1;
  }
  return res;
}
