Eulers Totient Function
hard
you have been given a number n, count the number of integers between 1 to n inclusive, which are co-prime to n.
Constraints
1 <= n <= 10^9
Format
Input
The first line contains the integer n.
Output
Output an integer in a line.
Example
Sample Input
7
Sample Output
6