#include <vector>
#include <iostream>
#include <algorithm>
using namespace std;
const int M = 32700;
const int M2 = 1'000'000'000;
//const int M = 50;
//const int M2 = 2500;
int a[M];
vector<vector<int>> x;
vector<int> vec_ans;
vector<int> primes;

void f(int i, int n, int p){
    if (n == 1){
        vec_ans.push_back(p);
        return;
    }
    if (i == size(x))
        return;
    int pre = 0;
    for (int v:x[i]){
        if (v > n)
            break;
        if (n % v == 0){
            int prime_power = v - pre;
            f(i+1, n / v, p * prime_power);
        }
        pre = v;
    }
}

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;
        primes.push_back(i);
        vector<int> y;
        for (int j = i*i; j < M; j+= i)
            a[j] = 1;
        int power_sum = 1;
        int po = 1;
        while (power_sum  < M2){
            y.push_back(power_sum);
            po *= i;
            power_sum += po;
            cnt++;
        }
        x.push_back(y);
    }

    int t; cin >> t;
    while (t--){
        // n 이 32'000 이상의 소수 + 1을 인수로 가질 경우.
        int n; cin >> n;
        vec_ans.clear();
        f(0, n, 1);
        for (int d = 1; d < M; d++){
            if (n % d == 0){
                int 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";
                        f(0, 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";
        }
    }
}