#include <bits/stdc++.h>
using namespace std ;
#define ll long long
// #define test
#ifndef test
#include "perm.h"
#endif
////////////////////////////////////////////////////////////////////////
std::vector<int> construct_permutation(long long K)
{
ll i,j ;
ll k=K ;
vector <ll> v ;
vector <int> ans ;
for (i = 60 ; i >= 0 ; i --){
if (k-(1ll<<i)>=0) k-=(1ll<<i),v.push_back(i) ;
}
reverse(v.begin(),v.end()) ;
// v[v.size()-1]-- ;
ll cnt=0 ;
ll cnt2=-1 ;
for (i = 0 ; i < (int)v.size()-1 ; i ++){
for (j = (i==0?0:v[i-1]) ; j < v[i] ; j ++) cnt2++ ;
if (i!=(int)v.size()-1){
cnt2++ ;
}
// else cnt2++ ;
}
for (j = (i==0?0:v[i-1]) ; j < v[i] ; j ++) cnt2++ ;
for (i = 0 ; i < (int)v.size()-1 ; i ++){
for (j = (i==0?0:v[i-1]) ; j < v[i] ; j ++) ans.push_back(cnt++) ;
if (i!=(int)v.size()-1){
ans.push_back(cnt2--) ;
}
// else ans.push_back(cnt++) ;
}
for (j = (i==0?0:v[i-1]) ; j < v[i] ; j ++) ans.push_back(cnt++) ;
// ans.push_back(cnt2--) ;
// for (auto x : ans) cout << x << " " ; cout << endl ;
return ans;
}
////////////////////////////////////////////////////////////////////////
#ifdef test
//grader{
#include <cstdio>
#include <vector>
#include <cassert>
#include <algorithm>
#include <stdlib.h>
using namespace std;
static long long MX=1e18;
static bool check_permutation(vector<int> v)
{
sort(v.begin(),v.end());
for(int i=0;i<v.size();i++)
if(v[i]!=i) return 0;
return 1;
}
long long count_increasing(const vector<int>& v) {
vector<long long> dp(v.size() + 1, 0);
dp[0] = 1;
for (int x : v)
{
for (int i = 0; i <= x; i++)
{
dp[x+1] += dp[i];
dp[x+1] = min(dp[x+1],MX+1);
}
}
long long result = 0;
for (int i = 0; i <= (int)v.size(); i++){
result += dp[i];
result = min(result,MX+1);
}
return result;
}
int main() {
int t;
assert(1 == scanf("%d", &t));
while(t--)
{
long long k;
assert(1 == scanf("%lld",&k));
vector<int> ret=construct_permutation(k);
if(!check_permutation(ret))
{
printf("WA: Returned array is not a permutation\n");
exit(0);
}
long long inc=count_increasing(ret);
if(inc!=k)
{
if(inc==MX+1)
printf("WA: Expected %lld increasing subsequences, found more than %lld\n",k, MX);
else
printf("WA: Expected %lld increasing subsequences, found %lld\n",k,inc);
exit(0);
}
printf("%d\n",(int)ret.size());
for(int i=0;i<ret.size();i++)
{
printf("%d",ret[i]);
if(i+1==ret.size())
printf("\n");
else
printf(" ");
}
}
return 0;
}
//grader}
#endif
