#include <bits/stdc++.h>
using namespace std;
int main() {
  long long int t, n, i, k;
  cin >> t;
  while (t--) {
    long long int temp = 1, s = 1;
    vector<long long int> ans;
    cin >> n;
    while (s <= n) {
      ans.push_back(temp);
      temp *= 2;
      s += temp;
    }
    s -= temp;
    if (s == n) {
      cout << ans.size() - 1 << endl;
      for (i = 1; i < ans.size(); i++) cout << ans[i] - ans[i - 1] << " ";
      cout << endl;
      continue;
    }
    ans.push_back(n - s);
    sort(ans.begin(), ans.end());
    cout << ans.size() - 1 << endl;
    for (i = 1; i < ans.size(); i++) cout << ans[i] - ans[i - 1] << " ";
    cout << endl;
  }
  return 0;
}
