#include<bits/stdc++.h>
#define int long long
#define ALL(a) a.begin(),a.end()
#define rep(i,n) for (int i = 0; i < n; i++)
#define rep1(i,n) for(int i=1;i<=(n);i++)
using namespace std;
template<class T> ostream& operator << (ostream &s, vector<T> &P)
{ for (int i = 0; i < P.size(); ++i) { if (i > 0) { s << " "; } s << P[i]; } return s; }

const int MAX = 1e5 + 1;
vector<int> X(MAX + 10);
vector<vector<int>> fact(MAX + 10,vector<int>{});

signed main(){
    int Q;
    cin>>Q;
    vector<int> Query(Q);
    rep(i,Q){cin>>Query[i];}
    rep1(i,MAX){X[i] = i * i + 1;}
    rep1(i,MAX){
        if (X[i] == 1)continue;
        else{
            int p = X[i];
            for (int j = i;j <= MAX; j += p){
               while(X[j] % p == 0){X[j]/= p;fact[j].push_back(p);}
            }
            for (int j = p - (i % p); j <= MAX; j+= p){
                while(X[j] % p == 0){X[j]/= p;fact[j].push_back(p);}            
            }
        }
    }

    for (int idx:Query){
        sort(ALL(fact[idx]));
        cout << fact[idx] << endl;
    }
  
    return 0;
}