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.

Examples

Input

6


Output

3


Input

3141


Output

13


Input

314159265358


Output

9
def find_divisor(x):
    Divisors = []
    for i in range(1, int(x**0.5) + 1):
        if x % i == 0:
            Divisors.append(i)
            if i != x // i:
                Divisors.append(x // i)
    return Divisors

n = int(input())
ways = len(find_divisor(n-1)) - 1
Div = find_divisor(n)
for i in range(1, len(Div)):
    quo = n
    while quo % Div[i] == 0:
        quo = quo // Div[i]
    if quo % Div[i] == 1:
        ways += 1
print(ways)