#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(ll i=0;i<n;i++)
#define repl(i,l,r) for(ll i=(l);i<(r);i++)
#define per(i,n) for(ll i=(n)-1;i>=0;i--)
#define perl(i,r,l) for(ll i=r-1;i>=l;i--)
#define fi first
#define se second
#define pb push_back
#define ins insert
#define pqueue(x) priority_queue<x,vector<x>,greater<x>>
#define all(x) (x).begin(),(x).end()
#define CST(x) cout<<fixed<<setprecision(x)
#define rev(x) reverse(x);
using ll=long long;
using vl=vector<ll>;
using vvl=vector<vector<ll>>;
using pl=pair<ll,ll>;
using vpl=vector<pl>;
using vvpl=vector<vpl>;
const ll MOD=1000000007;
const ll MOD9=998244353;
const int inf=1e9+10;
const ll INF=4e18;
const ll dy[8]={1,0,-1,0,1,1,-1,-1};
const ll dx[8]={0,1,0,-1,1,-1,1,-1};
template <typename T> inline bool chmax(T &a, T b) {
  return ((a < b) ? (a = b, true) : (false));
}
template <typename T> inline bool chmin(T &a, T b) {
  return ((a > b) ? (a = b, true) : (false));
}

int main(){
  vl dp(100010);
  rep(i,100010)dp[i]=i*i+1;
  vvl ans(100010);
  for(ll i=1;i<100010;i++){
    if(dp[i]==1)continue;
    ll p=dp[i];
    for(int j=-i;j<100010;j+=p){
      if(j<1)continue;
      while(dp[j]%p==0){
        dp[j]/=p;ans[j].push_back(p);
      }
    }
    for(int j=i;j<100010;j+=p){
      if(j<1)continue;
      while(dp[j]%p==0){
        dp[j]/=p;ans[j].push_back(p);
      }
    }
  }
  rep(i,100010)sort(all(ans[i]));
  ll q;cin >> q;
  while(q--){
    ll a;cin >> a;
    for(auto p:ans[a])cout << p <<" ";cout << endl;
  }
}