#include <bits/stdc++.h>
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
bool FLAG = 0;
using namespace std;
const long long MOD = (long long)1e9 + 7, N = (long long)2e6 + 222;
const long long INF = (long long)1e18;
long long dx[] = {0, -1, 0, 1, 0};
long long dy[] = {0, 0, 1, 0, -1};
long long b[N];
inline void solve() {
  long long n;
  cin >> n;
  long long k = 1;
  vector<long long> v;
  while (n != 0) {
    if (n < k) {
      v.push_back(n);
      n = 0;
      break;
    }
    n -= k;
    v.push_back(k);
    k += k;
  }
  sort(v.begin(), v.end());
  cout << (long long)(v.size()) - 1 << endl;
  for (long long i = 1; i < (long long)(v.size()); ++i) {
    cout << v[i] - v[i - 1] << " ";
  }
  cout << endl;
}
signed main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  long long t = 1;
  cin >> t;
  while (t--) {
    solve();
  }
  return 0;
}
