#include <bits/stdc++.h>

using namespace std;

using i64 = long long;

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    int kase;
    cin >> kase;
    while (kase--) {
        int n;
        cin >> n;
        vector<int> factors;
        for (int i = 1; i <= n / i; i += 1) {
            if (n % i == 0) {
                factors.push_back(i);
                if (i != n / i) {
                    factors.push_back(n / i);
                }
            }
        }
        if (n != 1) {
            factors.push_back(n);
        }
        sort(factors.begin(), factors.end());

        cerr << '\n';
        int lst = 0;
        i64 ans = 0;
        for (int i = 0; i < factors.size(); i += 1) {
            int lim = (i + 1 < factors.size() ? factors[i + 1] : n + 1);
            ans += 1LL * (lim - factors[i]) * n / factors[i];
            lst = lim + 1;
        }
        cout << ans << '\n';
    }

    return 0;
}