#include <vector>
#include <iostream>
#include <algorithm>
using namespace std;
using ll = long long;
const ll M = 32700;
const ll M2 = 1'000'000'000;
//const ll M = 50;
//const ll M2 = 2500;
int a[M];
// pair<pp sum,prime power>
vector<vector<pair<ll,ll>>> x;
vector<ll> vec_ans;
vector<ll> primes;

void f(int i, ll n, ll p){
    /*
    if (i == 0)
        cout << "x.size() " << x.size() << "\n";
        */
    if (n == 1){
        vec_ans.push_back(p);
        return;
    }
    if (i == size(x))
        return;
    ll pre = 0;
    for (auto [v,w]:x[i]){
        if (v > n)
            break;
        if (n % v == 0){
            f(i+1, n / v, p * w);
        }
        pre = v;
    }
}

void g(ll n, ll p){
    // i : prime in primes
    x.clear();
    for (int i:primes){
        vector<pair<ll,ll>> y;
        ll power_sum = 1;
        ll po = 1;
        while (power_sum  < M2){
            if (n % power_sum == 0)
                y.push_back({power_sum, po});
            po *= i;
            power_sum += po;
        }
        if (y.size() > 1)
            x.push_back(y);
    }
    f(0, n, p);
}

int main(void){
    ios::sync_with_stdio(0); cin.tie(0);
    int cnt = 0;
    for (int i = 2; i < M; i++){
        if (a[i] == 1)
            continue;
        for (int j = i*i; j < M; j+= i)
            a[j] = 1;
        primes.push_back(i);
    }

    int t; cin >> t;
    while (t--){
        // n 이 32'000 이상의 소수 + 1을 인수로 가질 경우.
        ll n; cin >> n;
        vec_ans.clear();
        g(n, 1);
        for (int d = 1; d < M; d++){
            if (n % d == 0){
                ll m = n / d;
                if (m > M){
                    int pri = 1;
                    //m-1 이 소수인지 검사.
                    for (int v:primes){
                        if ((m - 1) % v == 0){
                            pri = 0;
                            break;
                        }
                    }
                    if (pri){
                        // cout << "n/m " << 1.*n / m << ", prime " << (m-1) << "\n";
                        g(n/m, m-1);
                    }
                }
            }
        }
        int m = size(vec_ans);
        if (m == 0)
            cout << "none!\n";
        else {
            sort(vec_ans.begin(), vec_ans.end());
            cout << vec_ans[0];
            for (int i = 1; i < m; i++){
                cout << " " << vec_ans[i];
            }
            cout << "\n";
        }
    }
}