#include <stdio.h>
#include <string.h>

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

int main()
{
	freopen("sum.in", "r", stdin);
	freopen("sum.out", "w", stdout);

	int n, x, i, j, cnt = 0, phi, temp;
	long long sol;

	scanf("%d", &n);

	for(i = 1; i <= n; ++i)
	{
		scanf("%d", &x);
		temp = x;
		phi = x;
		for(j = 0; prime[j] * prime[j] <= x; ++j)
		{
			if(temp % prime[j] == 0)
			{
				phi /= prime[j];
				phi *= (prime[j] - 1);
				temp /= prime[j];
				while(temp % prime[j] == 0)
				{
					temp /= prime[j];
				}
			}
		}
		if(temp != 1)
		{
			phi /= temp;
			phi *= (temp - 1);
		}
		phi *= 2;
		sol = (long long) phi * x;
		printf("%lld\n", sol);
	}

	return 0;
}