#include<bits/stdc++.h>
using namespace std;
#pragma GCC optimize(2)
#define int long long
// #define int __int128
#define re read()
#define pr(x) print(x)
#define fup(a, b, c, d) for(int a = (b); a <= (c); a += (d))
#define fdo(a, b, c, d) for(int a = (b); a >= (c); a -= (d))
typedef long long ll;
typedef pair<int , int> PII;
typedef map<int , int> MII;
const int inf = 0x3f3f3f3f, N = 5e5 + 10, M = 4e5 + 10, mod = 1e9 + 7;
const ll INF = 0x3f3f3f3f3f3f3f3f;

vector<int> v, vv;

void divide(int x)
{
    for(int i = 2; i <= x / i; i ++ )
        if (x % i == 0)
        {
            int s = 1;
            while (x % i == 0) {
                x /= i, s *= i;
                v.push_back(s);
                // v1.push_back(s);
            }
            
            
        }
    if (x > 1) {
        v.push_back(x);
        // v1.push_back(x);
    }
}

int x;

int n;
vector<int> xz;

void dfs(int u)
{
    if(u == n) {
        ll su = 1;
        for(auto x : xz) {
            su *= x;
        }
        if(x % su == 0) vv.push_back(su);
        return ;
    }

    xz.push_back(v[u]);
    dfs(u + 1);
    xz.pop_back();

    xz.push_back(1);
    dfs(u + 1);
    xz.pop_back();
}


void solve()
{
    v.clear();
    vv.clear();
    xz.clear();
    
    cin >> x;
    divide(x);
    // cout << x << '\n';
    v.push_back(1);
    sort(v.begin(), v.end());
    n = v.size();

    int la;
    ll su = 0;

    dfs(0);

    for(auto x : vv) v.push_back(x);
    sort(v.begin(), v.end());
    v.erase(unique(v.begin() , v.end()) , v.end());

    fup(i, 0, v.size() - 1, 1) {
        // cout << v[i] << ' ';
        if(!i) {la = v[i]; continue;}
        su += (v[i] - la) * (x / la);
        la = v[i];
    }
    // cout << '\n';
    // cout << x << ' ' << la << '\n';
    // cout << su << '\n';
    if(x != la)
    su += (x - la) * (x / la);
    else su ++;

    if(x != la) su ++;
    
    
    cout << su << '\n';
}

signed main()
{
    cin.tie(0);
    cout.tie(0);
    ios::sync_with_stdio(false);

    int _ = 1;
    cin >> _;
    while(_ --)
    {
        solve();
    }
}