#include <bits/stdc++.h>
#pragma GCC target("avx2")
#pragma GCC optimization("O3")
#pragma GCC optimization("unroll-loops")
using namespace std;
const long long MOD = 1e9 + 7;
const long long INF = 1e18;
const long long MX = 2e5 + 10;
const long long nx[4] = {0, 0, 1, -1}, ny[4] = {1, -1, 0, 0};
template <class T>
using V = vector<T>;
template <class T>
bool ckmin(T& a, const T& b) {
  return a > b ? a = b, 1 : 0;
}
template <class T>
bool ckmax(T& a, const T& b) {
  return a < b ? a = b, 1 : 0;
}
long long cdiv(long long a, long long b) {
  return a / b + ((a ^ b) > 0 && a % b);
}
constexpr long long log2(long long x) { return 31 - __builtin_clz(x); }
void IO() {}
int32_t main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  IO();
  long long TC;
  cin >> TC;
  while (TC--) {
    long long N;
    cin >> N;
    long long NN = N;
    set<long long> div;
    for (long long i = 2; i * i <= N; i++)
      if (N % i == 0) {
        div.insert(i);
        div.insert(N / i);
      }
    div.insert(N);
    vector<long long> f;
    for (long long i = 2; i * i <= NN; i++)
      if (NN % i == 0) {
        f.push_back(i);
        while (NN % i == 0) NN /= i;
      }
    if (NN > 1) f.push_back(NN);
    if ((long long)f.size() == 2) {
      if (f[0] * f[1] == N) {
        cout << f[0] << ' ' << f[0] * f[1] << ' ' << f[1] << "\n";
        cout << 1 << "\n";
      } else {
        cout << f[0] << ' ';
        div.erase(f[0]);
        vector<long long> del;
        for (auto x : div)
          if (x % f[0] == 0 && x != f[0] * f[1] && x != N) {
            cout << x << ' ';
            del.push_back(x);
          }
        for (auto x : del) div.erase(x);
        cout << f[0] * f[1] << ' ';
        div.erase(f[0] * f[1]);
        cout << f[1] << ' ';
        div.erase(f[1]);
        del.clear();
        for (auto x : div)
          if (x % f[1] == 0 && x != N) {
            cout << x << ' ';
            del.push_back(x);
          }
        for (auto x : del) div.erase(x);
        cout << N << ' ';
        div.erase(N);
        cout << "\n";
        cout << 0 << "\n";
      }
    } else {
      set<long long> prod;
      for (long long i = (0); i < ((long long)f.size()); ++i)
        prod.insert(f[i] * f[(i + 1) % (long long)f.size()]);
      for (long long i = (0); i < ((long long)f.size()); ++i) {
        cout << f[i] << ' ';
        div.erase(f[i]);
        vector<long long> del;
        for (auto x : div)
          if (x % f[i] == 0 && prod.count(x) == 0) {
            cout << x << ' ';
            del.push_back(x);
          }
        for (auto x : del) div.erase(x);
        cout << f[i] * f[(i + 1) % (long long)f.size()] << ' ';
        div.erase(f[i] * f[(i + 1) % (long long)f.size()]);
      }
      cout << "\n";
      cout << 0 << "\n";
    }
  }
  return 0;
}
