#include <bits/stdc++.h>   using namespace std;   int ans[100005], t, n, d;   signed main() {     cin >> t;     while (t--) {       scanf( %d , &n);       int sum = ans[0] = 1;       for (int i = 1; i <= n; ++i) {         if (sum + (1 << (i + 1)) > n) {           d = i;           break;         }         sum += (1 << i);         ans[i] = (1 << i);       }       if (n - sum <= (1 << d)) {         ans[d] = n - sum;       } else {         ans[d] = (n - sum) / 2;         ans[d + 1] = n - sum - ans[d];         d++;       }       printf( %d n , d);       for (int i = 1; i < d; ++i) {         printf( %d  , ans[i] - ans[i - 1]);       }       printf( %d n , ans[d] - ans[d - 1]);     }     return 0;   }   