#include <bits/stdc++.h>
using namespace std;
long long int hcf(long long int x, long long int y) {
  if (y == 0) return x;
  return hcf(y, x % y);
}
int main() {
  long long int t;
  cin >> t;
  while (t--) {
    long long int n;
    cin >> n;
    long long int ans = log2(n) + 1;
    vector<long long int> a(ans);
    a[0] = 1;
    long long int sum = 1;
    long long int k = 2;
    for (long long int i = 1; i < ans - 1; i++) {
      a[i] = k;
      sum += a[i];
      k *= 2;
    }
    a[ans - 1] = n - sum;
    sort(a.begin(), a.end());
    cout << ans - 1 << '\n';
    for (long long int i = 1; i < a.size(); i++) {
      if (a[i] == a[i - 1]) {
        cout << 0 << " ";
      } else {
        cout << a[i] - a[i - 1] << " ";
      }
    }
    cout << '\n';
  }
}
