#include <bits/stdc++.h>
#include<unordered_map>
using namespace std;
typedef long long ll;
typedef long double ld;
#define N 201000
#define endl '\n'
ll mod = 998244353;
ll qpow(ll x, ll y);
int n;
vector<ll> a;


void solve() {
    ll n;
    cin >> n;
    a.clear();
    for (int i = 1; i * i <= n; i++) {
        if (n % i == 0) {
            int sum = n / i;
            a.push_back(sum);
            if (sum != i)a.push_back(i);
        }
    }
    sort(a.begin(), a.end());
    ll ans = 1 ;
    for (int i = 0; i < a.size(); i++)cout << a[i] << ' ';
    for (int i = 0; i < a.size() - 1; i++) {
        ans += (a[i + 1] - a[i])* (n / a[i]);
    }
    cout << ans << endl;
}

int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    int t = 1;
    cin >> t;
    while (t--) {
        solve();
    }

}

ll qpow(ll x, ll y) {
    ll sum = 1;
    while (y) {
        if (y & 1)sum = sum * x % mod;
        y >>= 1;
        x = x * x % mod;
    }
    return sum;
}