RelativelyPrime
For a given integer N (1 <= N <= 1000000000000) you have to find how many integer numbers A (1 <= A <= N) exist, so the Greatest Common Divider for numbers A and N is 1.
InputStandard input will contain only one integer N.
OutputOn the standard output you shoud print only one integer, the amount of numbers A.
Input:
Output:
9Output:
6Submit solution
Coming laterThe grading service will be connected in a later migration step. You can inspect the task and your previous results now.