#include <bits/stdc++.h>

int main() {
  std::ios::sync_with_stdio(false);
  std::cin.tie(nullptr);

  const int LG = 8;
  std::vector<std::set<int, std::greater<>>> good;
  for (int i = 0; i < (1 << LG); ++i) {
    std::set<int, std::greater<>> ele;
    for (int j = 0; j < LG; ++j) {
      if (((1 << j) & i) != 0) {
        ele.insert(LG - j);
      }
    }
    if (std::all_of(ele.begin(), ele.end(), [&](int v) {
          return std::all_of(ele.begin(), ele.end(), [&](int v2) {
            return ele.contains(std::gcd(v, v2));
          });
        }))
    {
      good.push_back(ele);
    }
  }
  std::sort(good.begin(), good.end());

  int t;
  std::cin >> t;
  while ((t--) != 0) {
    int k;
    std::cin >> k;
    std::cout << good[k].size();
    for (int i : good[k] | std::views::reverse) {
      std::cout << ' ' << i;
    }
    std::cout << '\n';
  }
}