#include<cstdio>
#include<math.h>

int prime [] = {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 , 10000} ;

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

int main ( )
{
	freopen ( "sum.in" , "r" , stdin ) ;
	freopen ( "sum.out" , "w" , stdout ) ;
	
	int i , qq , x ;
	scanf ( "%d" , &qq ) ;
	
	for ( i = 1 ; i <= qq ; ++i )
	{
		scanf ( "%d" , & x ) ;
		
		printf ( "%lld\n" , 2*(long long)x*phi(x) ) ;
		
	}
	
	return 0 ;
}