#define _USE_MATH_DEFINES #include using namespace std; #define FOR(i,m,n) for(int i=(m);i<(n);++i) #define REP(i,n) FOR(i,0,n) #define ALL(v) (v).begin(),(v).end() using ll = long long; constexpr int INF = 0x3f3f3f3f; constexpr long long LINF = 0x3f3f3f3f3f3f3f3fLL; constexpr double EPS = 1e-8; constexpr int MOD = 1000000007; // constexpr int MOD = 998244353; constexpr int dy[] = {1, 0, -1, 0}, dx[] = {0, -1, 0, 1}; constexpr int dy8[] = {1, 1, 0, -1, -1, -1, 0, 1}, dx8[] = {0, -1, -1, -1, 0, 1, 1, 1}; template inline bool chmax(T &a, U b) { return a < b ? (a = b, true) : false; } template inline bool chmin(T &a, U b) { return a > b ? (a = b, true) : false; } struct IOSetup { IOSetup() { std::cin.tie(nullptr); std::ios_base::sync_with_stdio(false); std::cout << fixed << setprecision(20); } } iosetup; int main() { constexpr int M = 100001; vector ans[M + 1]; ll x[M + 1]{}; for (int i = 1; i <= M; ++i) x[i] = 1LL * i * i + 1; for (int i = 1; i <= M; ++i) { if (x[i] == 1) continue; ll p = x[i]; for (ll j = i; j <= M; j += p) { while (x[j] % p == 0) { x[j] /= p; ans[j].emplace_back(p); } } for (ll j = -i % p + p; j <= M; j += p) { while (x[j] % p == 0) { x[j] /= p; ans[j].emplace_back(p); } } } for (int i = 1; i <= M; ++i) sort(ALL(ans[i])); int q; cin >> q; while (q--) { int n; cin >> n; int p = ans[n].size(); REP(i, p) cout << ans[n][i] << " \n"[i + 1 == p]; } return 0; }