#include <cstdio>
#include <algorithm>
#include <vector>
#include <bitset>
#define INF 2140000000
#define MaxN 100001
#define MaxX 100001
using namespace std;


int N,X,v[MaxX];
bitset <MaxX> p;
int main()
{
    freopen("sum.in","r",stdin);
    freopen("sum.out","w",stdout);
	for(int i=2;i<=MaxX;i++)
		v[i]=i;
	for(int i=2;i<MaxX;i++)
		if(!p[i])
		{
			v[i]=i-1;
			for(int j=i*2;j<MaxX;j+=i)
				v[j]=v[j]/i*(i-1),p[j]=1;
		}
	scanf("%d",&N);
	for(int i=1;i<=N;i++)
	{
		scanf("%d",&X);
		printf("%lld\n",1LL*2*X*v[X]);
	}
	return 0;
}