#include<bits/stdc++.h>

using namespace std;
using ull = unsigned long long;

const ull MAX = 1000;

ull pow(ull base, ull exp) {
	ull out = 1;
	for (ull i = 0; i < exp; i++) {
		out *= base;
	}

	return out;
}

pair<ull, ull> cntZ(ull n, ull b) {
	ull out = 0;
	ull bits = 0;
	while (n) {
		if (n%b == 0) out++;
		n /= b;
		bits++;
	}
	return { out, bits };
}

map<ull, pair<ull, ull>> ans;
map<ull, vector<ull>> memo;

void solve() {
	ull n;
	cin >> n;

	if (ans.count(n) != 0) {
		cout << ans[n].first << " " << ans[n].second;
		for (ull b : memo[n]) {
			cout << b << " ";
		}
		cout << endl;
		
		return;
	}

	ull max_zeros = 0;
	vector<ull> res;
	for (ull b = 2; b <= MAX && b <= n; b++) {
		pair<ull, ull> cnt = cntZ(n, b);

		if (cnt.first > max_zeros) {
			res.clear();
			res.push_back(b);
			max_zeros = cnt.first;
		} else if (cnt.first == max_zeros) {
			res.push_back(b);
		}
	}

	for (ull b = MAX + 1; pow(b, max_zeros) <= n; b++) {
		pair<ull, ull> cnt = cntZ(n, b);

		if (cnt.first > max_zeros) {
			res.clear();
			res.push_back(b);
			max_zeros = cnt.first;
		} else if (cnt.first == max_zeros) {
			res.push_back(b);
		}
	}

	ans[n] = make_pair(max_zeros, res.size());
	memo[n] = res;

	cout << max_zeros << " " << res.size() << endl;
	for (ull c : res) {
		cout << c << " ";
	}
	cout << endl;
}

signed main() {
	ull t;
	cin >> t;

	while (t--) solve();
}