#include<bits/stdc++.h>
using namespace std;
#define yes cout<<"Yes"<<endl
#define no cout<<"No"<<endl
#define int long long
using pii = pair<int, int>;

const int maxn = 1e6;
bool NotPrime[maxn + 5];
vector<int> Prime;
vector<bool> is_prime; // For larger values of x beyond maxn

bool isPrime(int x) {
    if (x < maxn) return !NotPrime[x];
    return is_prime[x]; // For large x
}

void ini() {
    NotPrime[0] = 1;
    NotPrime[1] = 1;
    for (int i = 2; i < maxn; i++) {
        if (NotPrime[i]) continue;
        Prime.push_back(i);
        for (int j = i * i; j < maxn; j += i) {
            NotPrime[j] = 1;
        }
    }

    // Initialize is_prime for large values up to a reasonable limit
    is_prime.resize(1e7 + 5, true);  // Adjust the upper bound based on your needs
    is_prime[0] = is_prime[1] = false;
    for (int i = 2; i * i <= 1e7; i++) {
        if (is_prime[i]) {
            for (int j = i * i; j <= 1e7; j += i) {
                is_prime[j] = false;
            }
        }
    }
}

// 质因子分解
vector<pii> solve(int x) {
    map<int, int> cnt;
    for (int i = 0; i < Prime.size(); i++) {
        while (x % Prime[i] == 0) {
            cnt[Prime[i]]++;
            x /= Prime[i];
        }
        if (x == 1) break;
        if (x < maxn) continue;
        if (isPrime(x)) {
            cnt[x]++;
            break;
        }
    }

    if (x > 1) {
        cnt[x]++; // If x is prime and greater than maxn
    }

    vector<pii> ans;
    for (auto it : cnt) 
        ans.push_back({it.first, it.second});
    return ans;
}

// 生成所有因数
void get_factor(vector<pii> cnt, set<int>& ans, int idx, int val) {
    if (idx == cnt.size()) return;
    int now = cnt[idx].first;
    int sum = cnt[idx].second;

    int pwr = 1;
    for (int i = 0; i <= sum; i++) {
        val *= pwr;
        ans.insert(val);
        get_factor(cnt, ans, idx + 1, val);
        val /= pwr;
        pwr *= now;
    }
}

int func(int a, int b, set<int>& st) {
    auto it = st.upper_bound(b);
    it--;
    return a / (*it);
}

signed main() {
    ios::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);
    
    ini();
    int t; 
    cin >> t;
    while (t--) {
        int n;
        cin >> n;

        // 获取n的质因子分解
        auto cnt = solve(n);
        set<int> st; 
        st.insert(1);

        // 生成所有因数
        get_factor(cnt, st, 0, 1);

        int sum = 1;
        int last = *st.begin();

        // 计算每个因数对的贡献
        for (auto it : st) {
            sum += (it - last) * n / last;
            last = it;
        }

        cout << sum << endl;
    }

    return 0;
}