Euler’s Totient Function Problem Statement

Given an integer N, your task is to determine the count of integers between 1 and N (inclusive) that are coprime to N.

Input:

The first line contains an integer 'T' denoting the number of test cases.
For each test case, the input consists of one line containing a single integer 'N'.

Output:

For each test case, output one line with a single integer representing the count of integers between 1 and N, inclusive, that are coprime to N.

Example:

If N is 9, the output should be 6 because there are six integers between 1 and 9 that are coprime to 9: 1, 2, 4, 5, 7, and 8.

Constraints:

• 1 <= T <= 100
• 1 <= N <= 10^9
• Time Limit: 1 second.

Note:

You don't have to print anything. This is already handled. Implement the function to return the result.