// what is matter? never mind. 
#include<bits/stdc++.h>
#define For(i,a,b) for(int i=(a);i<=(b);++i)
#define Rep(i,a,b) for(int i=(a);i>=(b);--i)
typedef int iint;
#define int long long
using namespace std;
inline int read()
{
	char c=getchar();int x=0;bool f=0;
	for(;!isdigit(c);c=getchar())f^=!(c^45);
	for(;isdigit(c);c=getchar())x=(x<<1)+(x<<3)+(c^48);
	if(f)x=-x;return x;
}

#define fi first
#define se second
#define pb push_back
#define mkp make_pair
typedef pair<int,int>pii;
typedef vector<int>vi;

#define maxn 10000005
#define inf 0x3f3f3f3f

int n;

iint pri[maxn],tot;
bool vis[maxn];
iint d[maxn];
void sieve(int n){
	vis[1]=1;
	d[1]=1;
	For(i,2,n){
		if(!vis[i])pri[++tot]=i,d[i]=2;
		For(j,1,tot){
			int x=i*pri[j];
			if(x>n)break;
			vis[x]=1;
			if(i%pri[j]==0){
				d[x]=d[i]*2-d[i/pri[j]];
				break;
			}
			d[x]=d[i]*2;
		}
	}
	For(i,1,n)d[i]+=d[i-1];
}

int calc(int n){
	if(n<=10000004) return d[n]; 
	int res=0;
	for(int l=1,r;l<=n;l=r+1){
		r=n/(n/l);
		res+=(r-l+1)*(n/l);
	}
	return res;
}

int calc1(int n){
	int res=0; 
	for(int l=1,r;l<=n;l=r+1){
		r=n/(n/l);
	//	cout<<"calc1 "<<l<<" "<<r<<"\n"; 
		res+=(r-l+1)*calc(n/l-1);
	}
	return res;
}

void work()
{
	n=read();
	int res=calc1(n);
	cout<<res<<'\n';
}

signed main()
{
	sieve(1e7+5);
	int T=read();
	while(T--)work();
	return 0;
}
/*

10 17
3 10 31

G 4G 7G 10G
G 3G 5G 7G 9G
G 2G 3G 4G 5G


4
A
QUERY B
ADD BBABBBBAAB
QUERY B
*/