#include<stdio.h>
#include<math.h>
int prim[]={0,2,3,5,7,11,13,17,19,23,29,31,37,41,43,47,53,59,61,67,71,73,79,83,89,97,101,103,107,109,113,127,131,137,139,149,151,157,163,167,173,179,181,191,193,197,199,211,223,227,229,233,239,241,251,257,263,269,271,277,281,283,293,307,311,313,317,331,337,347,349,353,359,367,373,379,383,389,397,500};


long long phi(long n)
{
long long phi;
phi=n;
long long cn=n,i,e;
i=1;
long lim=sqrt(n)+1;
while(n>1 && prim[i]<=lim)
  {
  e=0;
  while(n%prim[i]==0)
	 {
	 n=n/prim[i];
	 e++;
	 }
  if(e)
	 {
	 phi=phi/prim[i]*(prim[i]-1);
	 }
  i++;
  }
if(n>1)
  phi=phi/n*(n-1);
return (long long)2*(long long)cn*(long long)phi;
}


void read()
{
freopen("sum.in","r",stdin);
freopen("sum.out","w",stdout);
long n,x;
scanf("%ld",&n);
long i;
for(i=1;i<=n;i++)
  {
  scanf("%ld",&x);
  printf("%lld\n",phi(x));
  }
}


int main()
{
read();
return 0;
}