• 神奇的根号算法：数论分块
• 时间复杂度：$O(\sqrt{n})$

// 数论分块
// OI Wiki: https://oiwiki.org/math/number-theory/sqrt-decomposition/
#include <bits/stdc++.h>
using namespace std;

using i64 = long long;

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

    i64 T, n;
    cin >> T;
    while (T--) {
        cin >> n;
        i64 ans = 0;
        for (i64 l = 1, r; l <= n; l = r + 1) {
            // [l, r] 范围内的商都是 n / l
            r = n / (n / l);
            ans += n / l * (r - l + 1);
        }
        cout << ans << '\n';
    }
    return 0;
}