#include <bits/stdc++.h>
#define con const
using namespace std;

using i32 = int32_t;
using i64 = int64_t;
#define i128 __int128_t
using u32 = uint32_t;
using u64 = uint64_t;
using f64 = long double;

template<class T>
using lque = priority_queue<T, vector<T>, greater<T>>;
template<class T>
using gque = priority_queue<T>;

template<class T>
void mes(T * arr, u32 n, int val) {
    memset(arr, val, n*sizeof(T));
}

template<class T>
vector<u32> fac(T x) {
    if(x==1) return {1};
    vector<u32> pri = {1, x};
    T i;
    u32 lim = sqrt(x);
    for(i=2; i<lim; ++i) {
        if(x%i==0) {
            pri.push_back(i);
            pri.push_back(x/i);
        }
    }
    if(x%i==0) {
        pri.push_back(i);
        if(i*i!=x) pri.push_back(i);
    }
    return pri;
}

// -------------------
con i32 MX = 1e5 + 7;

u32 ip;

void solve() {
    auto vec = fac(ip);
    sort(vec.begin(), vec.end());
    u32 sz = vec.size();
    u64 ans = 0;
    vec.push_back(ip+1);
    for(u32 i=0; i<sz; ++i) {
        ans += u64(ip/vec[i])*(vec[i+1]-vec[i]);
    }
    cout << ans << '\n';
}

void pre() {
    cin >> ip;
}

u32 _t = 1;
void init() {
    ios::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);
    cin >> _t;
}

int main() {
    init();
    for(;_t--;) {
        pre();
        solve();
    }
}