#nt201. 欧拉函数

欧拉函数

Euler's Totient Function

Problem Description

Read TT, then TT test cases follow. Each case gives one number nn; output its Euler's totient function φ(n)\varphi(n).

Input Format

The first line contains one integer TT.

Each of the next TT lines contains one number nn.

Output Format

Output TT lines, each containing one number: the value of φ(n)\varphi(n) for that nn.

Sample Input

2
12345
987654321

Sample Output

6576
619703040

Constraints

For 100%100\% of the test cases, 1≤T≤1031 \le T \le 10^3 and 1≤n≤1091 \le n \le 10^9.