#include <bits/stdc++.h>
using namespace std;

vector<long long> bases;

void prep() {
  bases.reserve(78498);
  for (int i = 2; i < 1e6 + 1; i++)
  {
    
    // cout << i << endl;
    bool t = false;
    for (auto j : bases)
    {
      if(1LL*j*j > i){
        break;
      }
      t |= (i % j) == 0;
      if(t) break;
    }
    if(!t){
      // cout << i << '\n';
      bases.push_back(i);
    }
  }
}

void solve() {
  int n;
  cin >> n;
  auto foo = [](int n, int base) {
    int res = 0;
    int chis = 0;
    while (n != 0)
    {
      res += (n % base) == 0;
      chis++;
      n /= base;
    }
    return make_pair(res, chis);
  };
  pair<int, vector<long long>> ans = {0, {}};
  for (int i = 2; i <= 1e6; i++)
  {
    auto [del, chis] = foo(n, i);
    if(chis < ans.first){
      break;
    }
    if (ans.first == del) {
      ans.second.push_back(i);
      continue;
    }
    if (ans.first < del) {
      ans = {del, {i}};
      continue;
    }
  }
  if(ans.first == 1 && n >= 1e6){
    ans.second.push_back(n);
  }
  cout << ans.first << " " << ans.second.size() << '\n';
  for (auto i : ans.second) {
    cout << i << ' ';
  }
  cout << '\n';
}

int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  // prep();
  // cout << bases.size() << '\n';
  int t = 1;
  cin >> t;
  while (t--) {
    solve();
  }
}