Problem:
Score : 600 points

Problem Statement

Given is a positive integer N.

We will choose an integer K between 2 and N (inclusive), then we will repeat the operation below until N becomes less than K.

Operation: if K divides N, replace N with N/K; otherwise, replace N with N-K.

In how many choices of K will N become 1 in the end?

Constraints

2 \leq N \leq 10^{12}

N is an integer.

Input

Input is given from Standard Input in the following format:

N

Output

Print the number of choices of K in which N becomes 1 in the end.

Sample Input 1

6

Sample Output 1

3

There are three choices of K in which N becomes 1 in the end: 2, 5, and 6.

In each of these choices, N will change as follows:

When K=2: 6 \to 3 \to 1

When K=5: 6 \to 1

When K=6: 6 \to 1

Sample Input 2

3141

Sample Output 2

13

Sample Input 3

314159265358

Sample Output 3

9

Solution in Rust (1.42.0) (judge verdict: Wrong Answer)

use std::cmp::*;
use std::io::*;

fn check(n: usize, x: usize) -> bool {
    let mut m = n;
    while m % x == 0 {
        m /= x;
    }
    (m - 1) % x == 0
}

fn main() {
    let mut s: String = String::new();
    stdin().read_to_string(&mut s).ok();
    let mut itr = s.trim().split_whitespace();
    let n: usize = itr.next().unwrap().parse().unwrap();
    if n == 2 {
        println!("1");
    }

    let mut x = 2;
    let mut ans = 2;
    while x * x <= n {
        if n % x == 0 {
            ans += check(n, x) as usize;
            if x != n / x {
                ans += check(n, n / x) as usize;
            }
        }
        x += 1;
    }

    let m = n - 1;
    let mut y = 2;
    while y * y <= m {
        if m % y == 0 {
            ans += 1;
            if y != m / y {
                ans += 1
            }
        }
        y += 1;
    }
    println!("{}", ans);
}