// Author: Olaf Surgut (surgutti)
// Created on 01-10-2024 13:00:12
#include <bits/stdc++.h>
using namespace std;

#ifdef DEBUG
auto&operator<<(auto&o,pair<auto,auto>p){return o<<"("<<p.first<<", "<<p.second<<")";}
auto operator<<(auto&o,auto x)->decltype(x.end(),o){o<<"{";int i=0;for(auto e:x)o<<","+!i++<<e;return o<<"}";}
#define debug(X...)cerr<<"["#X"]: ",[](auto...$){((cerr<<$<<"; "),...)<<endl;}(X)
#else
#define debug(...){}
#endif

#define endl '\n'
#define st first
#define nd second
#define pb push_bask
#define sz(x) (int)(x).size()
#define all(x) (x).begin(), (x).end()
#define FOR(i, a, b) for (int i = (a); i <= (b); i++)
#define ROF(i, b, a) for (int i = (b); i >= (a); i--)
#define REP(i, n) for (int i = 0; i < (n); i++)

#define int long long

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

	int tt;
	cin >> tt;
	while (tt--) {
		int n;
		cin >> n;

		vector<int> maybe;
		int sq = max<int>(2, sqrt(n) - 5);
		for (int i = 2; i <= 2000; i++) {
			maybe.push_back(i);
			maybe.push_back(sq + i);
			maybe.push_back(n - 2 + i);
		}
	
		sort(all(maybe));
		maybe.erase(unique(all(maybe)), maybe.end());

		vector<int> ans;
		int best = 0;
		for (int x : maybe) if (x >= 2) {

			int m = n, now = 0;
			while (m > 0) {
				if (m % x == 0) {
					now++;
				}
				m /= x;
			}

			if (now > best) {
				ans = {x};
				best = now;
			}
			else
			if (now == best) {
				ans.push_back(x);
			}
		}

		cout << best << ' ' << ans.size() << '\n';
		for (int x : ans)
			cout << x << ' ';
		cout << '\n';

	}

	return 0;
}