#include <algorithm>
#include <cassert>
#include <vector>
#include <iostream>
using namespace std;
int main() {
    vector<vector<long long> > factors(100100);
    vector<long long> rem(100100);
    for (int i = 1; i < rem.size(); i++)
        rem[i] = (long long)i * i + 1;
    for (int i = 1; i < factors.size(); i++) {
        long long p = rem[i];
        if (p == 1) continue;
        for (long long j = i; j < 100100; j += p)
            while (rem[j] % p == 0) {
                rem[j] /= p;
                factors[j].push_back(p);
            }
        for (long long j = p - i; j < 100100; j += p)
            while (rem[j] % p == 0) {
                rem[j] /= p;
                factors[j].push_back(p);
            }
    }

    for (auto& v : factors) sort(v.begin(), v.end());

    int q; cin >> q;
    while (q--) {
        int k; cin >> k;
        for (int i = 0; i < factors[k].size(); i++) {
            cout << factors[k][i] << (i == factors[k].size() - 1 ? '\n' : ' ');
        }
    }
}