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: import java.io.*;
import java.util.*;



class Main {







static long CoPrime(long n)
    {

        double result = n;


        for (long p = 2; p * p <= n; ++p) {

            if (n % p == 0) {

                while (n % p == 0)
                    n /= p;
                result *= (1.0 - (1.0 / (double)p));
            }
        }


        if (n > 1)
            result *= (1.0 - (1.0 / (double)n));

        return (long)result;
    }


	public static void main (String[] args) throws IOException{


					 BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
					long t=Long.parseLong(br.readLine());
					while(t-->0){
						long ans=1;
						long k=Long.parseLong(br.readLine());





						System.out.println(CoPrime(k));
					}
	}
}, In this Programming Language: Java, Now tell me if this Code is compilable or not?