#include <stdio.h>         
        
int n,phi[100010];      
long long sum;         
        

void totient(int x)
{  
int i,j;
for (i=1;i<=x;++i) 
phi[i]=i;
for (i=2;i<=x;++i)
   if (phi[i]==i)
      for (j=i;j<=x;j+=i) 
            {
              phi[j]/=i;
              phi[j]*=(i-1);
             }
}
 
int main()         
{       
int T,i;        
freopen("sum.in","r",stdin);         
freopen("sum.out","w",stdout);        
scanf("%d\n",&T);
while (T--)         
{         
scanf("%d\n",&n); 
totient(n);
printf("%lld\n",2*n*phi[n]);    
}         
return 0;         
}