#include <bits/stdc++.h>
using namespace std;
int main()
{
vector<vector<int>> gfs={{}};
for (int n=1;n<=8;n++)
{
for (int m=0;m<(1<<n-1);m++)
{
bool pres[n+1]={};
vector<int> v={n};pres[n]=1;
for (int p=0;p<n-1;p++)
if ((m>>p)%2)
v.push_back(p+1),pres[p+1]=1;
bool pos=1;
for (int i=0;i<v.size() && pos;i++)
for (int j=i+1;j<v.size() && pos;j++)
if (!pres[__gcd(v[i],v[j])])
pos=0;
if (pos)
{
sort(v.begin(),v.end());
gfs.push_back(v);
}
}
}
int t;
cin>>t;
while (t--)
{
int x;
cin>>x;
cout<<gfs[x].size();
for (int i:gfs[x])
cout<<' '<<i;
cout<<endl;
}
return 0;
}
