#include <bits/stdc++.h>
using namespace std;
const long long mod = (long long)1e9 + 7;
const long long maxn = (long long)1e5 + 10;
const int nnn = 664579 + 500;
const int inf = numeric_limits<int>::max() - 1;
const long long INF = 1e18;
long long dx[] = {0, 1, 0, -1};
long long dy[] = {1, 0, -1, 0};
long long dxx[] = {0, 1, 0, -1, 1, 1, -1, -1};
long long dyy[] = {1, 0, -1, 0, 1, -1, 1, -1};
void solve() {
  long long n;
  vector<long long> v;
  long long two = 1;
  cin >> n;
  while (n) {
    if (two > n) {
      v.push_back(n);
      n = 0;
    } else
      v.push_back(two), n -= two;
    two *= 2;
  }
  sort(v.begin(), v.end());
  cout << v.size() - 1 << '\n';
  for (long long i = 1; i < v.size(); i++) cout << v[i] - v[i - 1] << ' ';
  cout << '\n';
  return;
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(NULL);
  cout.tie(NULL);
  long long T;
  T = 1;
  cin >> T;
  long long CT = 0;
  while (T--) {
    solve();
  }
  return 0;
}
