#include <bits/stdc++.h>
#define rep(i,l,r) for(int i=(l);i<=(r);++i)
#define per(i,r,l) for(int i=(r);i>=(l);--i)
using namespace std;
typedef long long ll;
const int N=1.5e6;
ll x;int T,f[N+10];
ll sum(ll n){
    if(n<=N) return f[n];
    ll ans=0;
    for(ll l=1,r;l<=n;l=r+1){
        r=n/(n/l);
        ans+=(r-l+1)*(n/l);
    }
    return ans;
}
ll cal(ll n){
    ll ans=0;
    for(ll l=1,r;l<=n;l=r+1){
        r=n/(n/l);
        ans+=(r-l+1)*sum(n/l-1);
    }
    return ans;
}
void pre(int n){
    rep(i,1,n) rep(j,1,n/i) f[i*j]++;
    rep(i,1,n) f[i]+=f[i-1];
}
int main(){
    //cerr << sizeof(f)/1024/1024 << endl;
    scanf("%d",&T);pre(N);
    while(T--){
        scanf("%lld",&x);
        printf("%lld\n",cal(x));
    }
    return 0;
}