#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;

const int MX = 4e5;
int mem[MX];

ll calc(ll n)
{
	if(n < MX && mem[n] != -1) return mem[n];
	
	ll sq = sqrt(n) + 2;
	while(sq * sq > n) --sq;
	
	ll res = 0, l = sq, r;
	for(int i=sq; i>=1; --i)
	{
		r = n / i;
		res += r + i * (r - l);
		l = r;
	}
	
	if(n < MX) mem[n] = res;
	return res;
}

void solve(void)
{
	ll n;
	scanf("%lld",&n);
	
	ll res = 0;
	for(ll l=1,r; l<=n; l=r+1)
	{
		ll k = n/l; r = n/k;
		res += calc(k-1) * (r-l+1);
	}
	printf("%lld\n",res);
}

int main(void)
{
//	freopen("E.in","r",stdin);
//	printf("%lf\n",(sizeof(mem)) / 1024.0 / 1024.0);
	
	memset(mem, -1, sizeof(mem));
	
	int T;
	scanf("%d",&T);
	while(T--) solve();
	return 0;
}