#include <bits/stdc++.h>
using namespace std;
template <class T>
ostream &operator<<(ostream &os, vector<T> V) {
  os << "[ ";
  for (auto v : V) os << v << " ";
  os << "]";
  return os;
}
template <class T>
ostream &operator<<(ostream &os, set<T> S) {
  os << "{ ";
  for (auto s : S) os << s << " ";
  return os << "}";
}
template <class L, class R>
ostream &operator<<(ostream &os, map<L, R> M) {
  os << "{ ";
  for (auto m : M) os << "(" << m.first << ":" << m.second << ") ";
  return os << "}";
}
template <class L, class R>
ostream &operator<<(ostream &os, pair<L, R> P) {
  return os << "(" << P.first << "," << P.second << ")";
}
const long long N = 100005;
long long getMoves(vector<long long> &v, int n) {
  long long moves = 0;
  for (long long i = 1; i < v.size(); i++) {
    if (v[i - 1] * v[i] > n) moves++;
  }
  if (v.size() > 2 && v[0] * v.back() > n)
    moves++;
  else if (v.size() == 2 && v[0] * v[0] * v[1] > n)
    moves++;
  return moves;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  long long t;
  cin >> t;
  while (t--) {
    long long n;
    cin >> n;
    int m = n;
    vector<long long> prime;
    vector<long long> divisors;
    for (long long i = 2; i * i <= n; i++) {
      if (n % i == 0) {
        if (i == n / i)
          divisors.push_back(i);
        else
          divisors.push_back(i), divisors.push_back(n / i);
      }
    }
    divisors.push_back(n);
    for (long long i = 2; i * i <= n; i++) {
      if (n % i == 0) {
        long long c = 0;
        while (n % i == 0) n /= i;
        prime.push_back(i);
      }
    }
    if (n > 1) prime.push_back(n);
    if (prime.size() == 1) {
      for (long long i = 0; i < divisors.size(); i++)
        cout << divisors[i] << ' ';
      cout << '\n';
      cout << 0 << '\n';
      continue;
    }
    sort(prime.begin(), prime.end());
    long long mn = getMoves(prime, m);
    vector<long long> ans = prime;
    while (next_permutation(prime.begin(), prime.end())) {
      long long moves = getMoves(prime, m);
      if (moves < mn) {
        mn = moves;
        ans = prime;
      }
    }
    prime = ans;
    if (prime.size() == 2) {
      long long k = prime[0] * prime[1];
      vector<long long> v1, v2;
      for (long long i = 0; i < divisors.size(); i++) {
        if (divisors[i] % k == 0) {
          if (v1.empty())
            v1.push_back(divisors[i]);
          else
            v2.push_back(divisors[i]);
          divisors[i] = 1;
        }
      }
      for (long long j = 0; j < divisors.size(); j++) {
        if (divisors[j] % prime[0] == 0)
          cout << divisors[j] << ' ', divisors[j] = 1;
      }
      for (long long i = 0; i < v1.size(); i++) cout << v1[i] << ' ';
      for (long long j = 0; j < divisors.size(); j++) {
        if (divisors[j] % prime[1] == 0)
          cout << divisors[j] << ' ', divisors[j] = 1;
      }
      for (long long i = 0; i < v2.size(); i++) cout << v2[i] << ' ';
      cout << '\n';
      cout << mn << '\n';
    } else {
      vector<long long> v[(int)prime.size()];
      for (long long i = 0; i < prime.size(); i++) {
        long long k;
        if (i < prime.size() - 1)
          k = prime[i] * prime[i + 1];
        else
          k = prime[i] * prime[0];
        for (long long j = 0; j < divisors.size(); j++) {
          if (divisors[j] % k == 0) {
            v[i].push_back(divisors[j]);
            divisors[j] = 1;
          }
        }
      }
      for (long long i = 0; i < prime.size(); i++) {
        for (long long j = 0; j < divisors.size(); j++) {
          if (divisors[j] % prime[i] == 0) {
            cout << divisors[j] << ' ';
            divisors[j] = 1;
          }
        }
        for (long long j = 0; j < v[i].size(); j++) cout << v[i][j] << ' ';
      }
      cout << '\n';
      cout << mn << '\n';
      for (long long i = 0; i < divisors.size(); i++) {
        if (divisors[i] != 1) cout << divisors[i] << '\n';
      }
    }
  }
  return 0;
}
