Primitive Roots
时间限制：C/C++/Rust/Pascal 1秒，其他语言2秒
空间限制：C/C++/Rust/Pascal 9.765625 M，其他语言19.53125 M
64bit IO Format: %lld

题目描述

We say that integer x, 0 < x < p, is a primitive root modulo odd prime p if and only if the set { (x i mod p) | 1 <= i <= p-1 } is equal to { 1, ..., p-1 }. For example, the consecutive powers of 3 modulo 7 are 3, 2, 6, 4, 5, 1, and thus 3 is a primitive root modulo 7.
Write a program which given any odd prime 3 <= p < 65536 outputs the number of primitive roots modulo p.

输入描述:

Each line of the input contains an odd prime numbers p. Input is terminated by the end-of-file seperator.

输出描述:

For each p, print a single number that gives the number of primitive roots in a single line.
示例1

输入

复制 
23
31
79

输出

复制 
10
8
24