#include <bits/stdc++.h>
using namespace std;
const long long MAXN = 1e9;
const int SIZE = 2e5 + 5;
const int MOD = 1e9 + 7;
void solve(int CASE) {
  long long x;
  cin >> x;
  vector<long long> res;
  for (long long i = 1; i <= x; i *= 2LL) {
    res.push_back(i);
    x -= i;
  }
  if (x) res.push_back(x);
  sort(res.begin(), res.end());
  cout << res.size() - 1 << endl;
  for (int i = 1; i < res.size(); i++) cout << res[i] - res[i - 1] << " ";
  cout << endl;
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  int IT;
  cin >> IT;
  for (int i = 1; i <= IT; i++) {
    solve(i);
  };
  return 0;
}
