#include <bits/stdc++.h>
using namespace std;
using i64 = int64_t;
#define all(x) (x).begin(), (x).end()
#define x first
#define y second
#define endl "\n" 
// #define int long long
#define sz(x) ((int)(x).size())
#define lowbit(x) ((x) & -(x))
#define IOS ios::sync_with_stdio(0);cin.tie(0);cout.tie(0)
#define rep(i,x,y) for(int i = x;i<y;i++)
#define reb(i,x,y) for(int i = x;i<=y;i++)
typedef long long ll;
typedef pair<int, int> pii;
typedef double db;
typedef long double ld;
const int N = 1e5+10, M = 2e7+10, mod = 998244353 , inf = 0x7fffffff;
const ld eps = 1e-12;
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
ll powmod(ll a,ll b) {ll res=1;a%=mod; assert(b>=0); for(;b;b>>=1){if(b&1)res=res*a%mod;a=a*a%mod;}return res;}



inline void solve() {
    int n;
    cin>>n;
    int now = n;
    vector<int> res = {1, n};
    for(int i = 2;i<=sqrt(n);i++){
        if(n%i==0){
            res.push_back(i);
            if(i==n/i)continue;
            res.push_back(n/i);
        }
    }

    sort(all(res));
    int sz = res.size();



    // i64 ans = 0, lst = 1, pre = n;
    // for(int i = 0;i<res.size();i++){
    //     ans += (res[i]-lst) * pre;
    //     pre = n/res[i];
    //     lst = res[i];
    // }
    // ans += 1;


    i64 ans = 0;
    for(int i = 1;i<sz;i++){
        ans += n/res[i-1] * (res[i]-res[i-1]);
    }
    ans+=1;
    cout<<ans<<endl;

}

signed main(){
    IOS;
    cout << fixed << setprecision(10);
    int __ = 1;
    cin>>__;
    while(__--) {
        solve();
        // cout<<endl;
    }
    return 0;
}