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 yakusu(x):
    ya = []
    for i in range(1,int(x**0.5)+1):
        if x % i == 0:
            ya.append(i)
            if i != x//i:
                ya.append(x //i)
    return ya

n = int(input())
l,m,ans = yakusu(n),yakusu(n-1),0
for i in range(1,len(l)):
    a = n
    while a % l[i] == 0:
        a = a // l[i]
    if (a-1) % l[i] == 0:
        ans += 1
ans += len(m)
print(ans-1)