#include <bits/stdc++.h>
#pragma GCC optimize("Ofast,unroll-loops")
#pragma GCC target( \
    "sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")
using namespace std;
void itval(istream_iterator<string> it) {}
template <typename T, typename... Args>
void itval(istream_iterator<string> it, T a, Args... args) {
  cerr << *it << " = " << a << endl;
  itval(++it, args...);
}
const long long int MOD = 1e9 + 7;
template <typename T>
inline void print(T x) {
  cout << x << "\n";
}
template <typename T>
inline void printvec(T x) {
  for (auto a : x) cout << a << ' ';
  cout << '\n';
}
struct custom {
  bool operator()(const pair<int, int> &p1, const pair<int, int> &p2) const {
    if (p1.second == p2.second) return p1.first < p2.first;
    return p1.second < p2.second;
  }
};
long long int get_pow(long long int a, long long int b) {
  long long int res = 1;
  while (b) {
    if (b & 1) res = (res * a) % MOD;
    a = (a * a) % MOD;
    b >>= 1;
  }
  return res;
}
const long long int N = 2e3 + 5, inf = 1e18;
void solve() {
  long long int n, sum = 1, x = 1;
  cin >> n;
  vector<long long> v = {x};
  while (sum + 2 * x < n) {
    sum += 2 * x;
    x = x * 2;
    v.push_back(x);
  }
  if (sum < n) {
    v.push_back(n - sum);
  }
  sort(v.begin(), v.end());
  cout << v.size() - 1 << '\n';
  for (long long int i = (long long int)1; i < (long long int)(v.size()); i++)
    cout << v[i] - v[i - 1] << ' ';
  cout << '\n';
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  int test = 1;
  cin >> test;
  clock_t z = clock();
  for (long long int tes = (long long int)0; tes < (long long int)(test);
       tes++) {
    solve();
  }
  fprintf(stderr, "Total Time:%.4f\n", (double)(clock() - z) / CLOCKS_PER_SEC),
      fflush(stderr);
  return 0;
}
