跳到主要内容
图灵 OJTURING / ONLINE JUDGE

#F2515. Cows and Primitive Roots

  • ID: 2521
  • 传统题
  • 2000ms
  • 256MiB
  • 尝试: 0
  • AC · 已通过: 0
  • 教学难度:基础
  • 上传者:
  • 模拟
  • 数学
  • 数论
  • 编程与模拟
  • 基础
  • 难度
  • 共享题库
  • Codeforces
  • 英文题面
  • 题目来源
  • 题面语言

Cows and Primitive Roots

题目描述

A. Cows and Primitive Roots
time limit per test
2 seconds
memory limit per test
256 megabytes
input
standard input
output
standard output

The cows have just learned what a primitive root is! Given a prime p, a primitive root is an integer x (1≤x<p) such that none of integers x-1,x2-1,...,xp-2-1 are divisible by p, but xp-1-1 is.

Unfortunately, computing primitive roots can be time consuming, so the cows need your help. Given a prime p, help the cows find the number of primitive roots .

Input

The input contains a single line containing an integer p (2≤p<2000). It is guaranteed that p is a prime.

Output

Output on a single line the number of primitive roots .

Examples
Input
3
Output
1
Input
5
Output
2
Note

The only primitive root is 2.

The primitive roots are 2 and 3.


题目来源:fps-www.educg.net-codeforce-1-2833.xml.zip;FPS 共享题包,题包内第 2157 题。保留原作者与原赛事署名。