#include <bits/stdc++.h>
using namespace std;
void c_p_c() {}
long long max(long long a, long long b) {
  if (a > b)
    return a;
  else
    return b;
}
long long min(long long a, long long b) {
  if (a < b)
    return a;
  else
    return b;
}
long long gcd(long long a, long long b) {
  if (a < b) swap(a, b);
  if (b == 0) return a;
  a %= b;
  return gcd(b, a);
}
long long lcm(long long a, long long b) { return (a * 1LL * b) / gcd(a, b); }
const long long N = 2e5 + 5;
const long long INF = 1e9 + 5;
long long w, n, ut, k, p;
set<long long> s;
void solve() {
  cin >> n, ut = n, k = 0, p = 0;
  for (long long i = 2; i * i <= n; i++)
    if (n % i == 0) s.insert(i), s.insert(n / i), k += (i * i == n / i);
  if (s.size() == 2 and !k)
    cout << *(s.begin()) << " ", s.erase(*s.begin()), p = 1;
  cout << ut << " ";
  while (s.size() > 0)
    for (auto it = s.begin(); it != s.end(); ++it)
      if (gcd(ut, *it) != 1) {
        ut = *it, s.erase(ut), cout << ut << " ";
        break;
      }
  cout << "\n" << p << "\n";
}
int32_t main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  c_p_c();
  long long tc = 1;
  cin >> tc;
  for (long long t = 1; t <= tc; t++) {
    solve();
  }
  return 0;
}
