#include <bits/stdc++.h>
#define endl '\n'

using ll = long long;

constexpr int N = 2e5 + 10;
constexpr int mod = 998244353;

using namespace std;

void solve(){
	int n;
	cin >> n;
	vector<int> pendings;
	for (int i = 1; i * i <= n; ++i) {
		if (n % i == 0) {
			pendings.push_back(i);
			if (n / i != i) pendings.push_back(n / i);
		}
	}
	sort(pendings.begin(), pendings.end(), [&](int x, int y){return x > y;});
	int lst = n + 1;
	ll ans = 0;
	for (auto x : pendings) {
		ans = ans + 1ll * (lst - x) * (n / x);
		lst = x;
	}
	cout << ans << endl;
}

signed main(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    int t = 1;
    cin >> t;
    while(t--) solve();
    return 0;
}