Again irreducible#339

Again irreducible

1 second
128 megabytes
Very easy

The fraction is called regular irreducible if 0 < m < n and \gcd(m, n) = 1. Find the number of regular irreducible fractions with the denominator .

Input

Each line is a separate test case and contains one integer (n < 10^9). The last line contains and is not processed. The number of test cases does not exceed .

Output

For each value of , print in a separate line the number of regular irreducible fractions with the denominator .

Examples

Example 1

Loading
Loading