#include<stdio.h>
#include<stdio.h>
#define N 100128
#define RAD 45000
long ciur[N],eu[N];
long long prime[N];
long long i,t,nr=0;
/*void eratostene()
{
	int i,j;
	ciur[0]=ciur[1]=1;
	for(i=2;i*i<RAD;++i)
		if(!ciur[i])
		for(j=i<<1;j<RAD;j+=i)
			ciur[j]=1;
	for(i=2;i<RAD;++i)
		if(!ciur[i])
	prime[nr++]=i;
}

int caut(int x)
{   for(int i=0;prime[i]*prime[i]<=x;++i)
	if(x%prime[i]==0)
		return prime[i];
	return x;
}
long long euler(int n)
{
	int i,p;
	long long s=1;
	eu[1]=1;
	for(i=2;i<=n;++i)
	{
		p=caut(i);
		if(i%(p*p)==0)
			eu[i]=eu[i/p]*p;
		else
			eu[i]=eu[i/p]*(p-1);
		//printf("%d ", eu[i]);
		s+=eu[i]<<1;  printf("%d ", i);
	}
	return s;
}*/
void totient(){
	long i,j;
	for(i=2;i<=N;i++)
		eu[i]=i;
	for(i=2;i<=N;i++)
		if(!prime[i])
			for(j=i;j<=N;j+=i){
				prime[j]=1;
				eu[j]=eu[j]-(eu[j]/i);
			}
}
int main()
{
	long rez=0,n;
	freopen("sum.in","r",stdin);
	freopen("sum.out","w",stdout);
	scanf("%lld", &t);
	totient();
	for(i=1;i<=t;++i)
	{
		scanf("%lld",&n);
	    //eratostene();
		rez=2*eu[n]*n;
		printf("%lld\n", rez);
	}	
	return 0;
}