#include<iostream>

 #include<algorithm>

 #include<cstring>

 #include<string>

 #include<cmath>

 #include<vector>

 #define lson l, mid, i<<1

 #define rson  mid + 1, r, i<<1|1

 using namespace std;

 typedef long long ll;

 const int maxn = 2e5 + ;

 int fa[maxn];

 int lowbit(int x) { return x & (-x); }

 int qpow(ll a, ll b) {

     ll ans = ;

     while (b) {

         if (b & )

             ans = ans * a;

         a = a * a;

         b /= ;

     }

     return ans;

 }

 int main() {

     int t;

     scanf("%d", &t);

     while (t--) {

         int n;

         scanf("%d", &n);

         int Max = qpow(, ) - , ans = ;

         for (int i = ; i <= n; i++) {

             if (i % ) {

                 if (lowbit(i) == i) continue;

                 int fat = lowbit((~i) &Max);

                 if (fat > n)fa[i] = , ans++;

                 else fa[i] = fat;

             }

             else

                 fa[i] = ;

         }

         printf("%d\n", ans);

         for (int i = ; i <= n; i++)

             printf("%d%c", fa[i], i == n ? '\n' : ' ');

     }

 }