#include <bits/stdc++.h>
using namespace std;
using ill = int64_t;

const int MXN = 1e6 + 7;

ill n;

ill get_rb(ill rem, ill v) {
    return rem/(rem/v)+1;
}

map<ill, ill> dp;
ill calc(ill lim) {
    if(dp.count(lim)) return dp[lim];
    ill l = 1, r;
    ill res = 0;
    while(l<=lim) {
        ill val = lim/l;
        r = min(get_rb(lim, l), lim+1);
        res += val*(r-l);
        l = r;
    }
    return dp[lim]=res;
}

void solve() {
    ill l = 1, r;
    ill res = 0;
    while(l<=n) {
        ill val = calc(n/l-1);
        r = min(get_rb(n, l), n+1);
        res += val*(r-l);
        l = r;
    }
    cout << res;
}

void aft() {
    cout << '\n';
}

void pre() {
    cin >> n;
}

int t_;
void init() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.tie(nullptr);
    cin >> t_;
}

int main() {
    init();
    for(int i=1; t_;) {
        pre(); solve();
        if(++i<=t_) aft();
        else exit(0);
    }
}