#include <vector>
#include <cassert>
#include <iostream>
#include <algorithm>
using namespace std;
const int limit = 100001;
bool isprime[100009];
vector<int> factors[100009];
int main() {
	fill(isprime + 2, isprime + limit + 1, true);
	for(int i = 2; i <= limit; ++i) {
		if(!isprime[i]) continue;
		for(int j = i * 2; j <= limit; j += i) {
			isprime[j] = false;
		}
	}
	for(int i = 1; i <= limit; i += 2) {
		factors[i].push_back(2);
	}
	for(int i = 3; i <= limit; ++i) {
		if(!isprime[i]) continue;
		for(int j = 1; j * 2 < i; ++j) {
			if((1LL * j * j + 1) % i == 0) {
				for(int k = j; k <= limit; k += i) {
					factors[k].push_back(i);
				}
				for(int k = i - j; k <= limit; k += i) {
					factors[k].push_back(i);
				}
			}
		}
	}
	cin.tie(0);
	ios_base::sync_with_stdio(false);
	int Q;
	cin >> Q;
	while(Q--) {
		int v;
		cin >> v;
		long long A = 1LL * v * v + 1;
		vector<long long> ans;
		for(int i : factors[v]) {
			while(A % i == 0) {
				A /= i;
				ans.push_back(i);
			}
		}
		if(A != 1) ans.push_back(A);
		for(int i = 0; i < int(ans.size()); ++i) {
			if(i) cout << ' ';
			cout << ans[i];
		}
		cout << '\n';
	}
	return 0;
}