//qoj4252
#include <bits/stdc++.h>
using namespace std;

vector<int> construct_permutation(long long k){
    vector<int> rs, tmp;
    long long mx = 1;
    int cnt = 0, nw = 0, flg = 0, mn = 0, cmn = 0, cq = 1;
    while(mx * 2 <= k){
        mx *= 2;
        ++ cnt;
    }
    k -= mx;
    for(int i = 0; i < cnt; ++ i){
        rs.push_back(i);
        if(flg){
            rs.push_back(cmn + 100 - cq);
            ++ cq;
            k -= 1ll << cnt - i - 0;
            k -= 1ll << cnt - i - 1;
            flg = 0;
        } else if(nw >= 2 && ((k>>cnt-i-1) & 1) && ((k>>cnt-i-2) & 1)){
            flg = 1;
        } else if((k>>cnt-i-1) & 1){
            rs.push_back(-i*1000 - 2666);
            cmn = mn;
            mn = -i * 1000 - 2666;
            cq = 0;
            k -= 1ll << cnt - i - 1;
            ++ nw;
        }
    }
    for(int i = 0; i < rs.size(); ++ i){
        int x = 0;
        for(int j = 0; j < rs.size(); ++ j){
            if(rs[j] < rs[i]){
                ++ x;
            }
        }
        tmp.push_back(x);
    }
    return tmp;
}

#ifndef ONLINE_JUDGE
int main(){
    int q, k;
    scanf("%d", &q);
    while(q--){
        long long n;
        scanf("%lld", &n);
        vector<int> rs = construct_permutation(n);
        printf("%d\n", rs.size());
        for(int i : rs){
            printf("%d ", i);
        }
        puts("");
        int len = rs.size();
        long long ans = 1;
        static long long f[1010];
        for(int i = 0; i < len; ++ i){
            f[i] = 1;
            for(int j = 0; j < i; ++ j){
                if(rs[j] < rs[i]){
                    f[i] += f[j];
                }
            }
            ans += f[i];
        }
        printf("%lld\n", ans);
    }
}
#endif