For this Question: In number theory, the totient Q(N) of a positive integer N is defined as the number of positive integers less than or equal to N that are co-prime to N.

Given an integer N. Compute the value of the totient Q(N) .First line contain integer t denoting number of test cases.
Next t lines contains an integer x. 

Constraints 
1<=t<=5
1<=x<=10^12For each test case print Q(n) in separate lineSample Input
4
1
2
3
6

Sample output
1
1
2
2, I have written this Solution Code: def totient(n):
    result = n;
    p = 2;
    while(p * p <= n):
        if (n % p == 0):
            while (n % p == 0):
                n = int(n / p);
            result -= int(result / p);
        p += 1;
    if (n > 1):
        result -= int(result / n);
    return result;
 

for n in range(int(input())):
	print(totient(int(input()))), In this Programming Language: Python, Now tell me if this Code is compilable or not?