#include<bits/stdc++.h>
#define rep(i,a,b) for (int i = (a); i <= (b); ++i)
#define drep(i,a,b) for (int i = (a); i >= (b); --i)
#define grep(i,u) for (int i = head[u],v = e[i].v; i; v = e[i = e[i].nxt].v)
#define LL long long
#define il inline
#define pii pair<int,int>
#define pll pair<LL,LL>
#define fi first
#define se second
#define pb push_back
#define mp make_pair
using namespace std;
il LL read() {
	LL x = 0,y = 1; char ch = getchar(); while (!isdigit(ch)) {if (ch == '-') y = -y; ch = getchar();}
	while (isdigit(ch)) {x = x*10+ch-'0'; ch = getchar();} return x*y;
}
namespace qiqi {
	const int N = 12e5+1; LL n; int d[N];
	il void init(int n) {
		rep(i,1,n) {
			rep(j,1,n/i) ++d[i*j];
			d[i] += d[i-1];
		}
	}
	il LL calc(LL n) {
		if (n < N) return d[n]; LL res = 0;
		for (LL l = 1,r; l <= n; l = r+1) {
			r = n/(n/l); res += n/l*(r-l+1);
		}
		return res;
	}
	void main() {
		LL ans = 0,lst = 0; n = read();
		for (LL l = 1,r; l <= n; l = r+1) {
			r = n/(n/l); LL cur = calc(r-1);
			ans += n/l*(cur-lst); lst = cur;
		}
		printf("%lld\n",ans);
	}
}
int main() {
	qiqi::init(qiqi::N-1); int T = read(); while (T--) qiqi::main(); return 0;
}