{"raw_statement":[{"iden":"problem statement","content":"Given is a positive integer $N$.\nWe will choose an integer $K$ between $2$ and $N$ (inclusive), then we will repeat the operation below until $N$ becomes less than $K$.\n\n*   Operation: if $K$ divides $N$, replace $N$ with $N/K$; otherwise, replace $N$ with $N-K$.\n\nIn how many choices of $K$ will $N$ become $1$ in the end?"},{"iden":"constraints","content":"*   $2 \\leq N \\leq 10^{12}$\n*   $N$ is an integer."},{"iden":"input","content":"Input is given from Standard Input in the following format:\n\n$N$"},{"iden":"sample input 1","content":"6"},{"iden":"sample output 1","content":"3\n\nThere are three choices of $K$ in which $N$ becomes $1$ in the end: $2$, $5$, and $6$.\nIn each of these choices, $N$ will change as follows:\n\n*   When $K=2$: $6 \\to 3 \\to 1$\n*   When $K=5$: $6 \\to 1$\n*   When $K=6$: $6 \\to 1$"},{"iden":"sample input 2","content":"3141"},{"iden":"sample output 2","content":"13"},{"iden":"sample input 3","content":"314159265358"},{"iden":"sample output 3","content":"9"}],"translated_statement":null,"sample_group":[],"show_order":["default"],"formal_statement":null,"simple_statement":null,"has_page_source":true}