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 divisor(n):
    x=[]
    y=[]
    for i in range(1,int(n**.5)+1):
        if n%i==0:
            x.append(i)
            y.append(n//i)
    if y[-1]==x[-1]:
        y=y[:-1]
    return x+y[::-1]
N=int(input())
a=0
d=divisor(N)
for K in d:
    if K==1:continue
    n=N
    while n>=K:
        if n%K==0:
            n//=K
        else:
            n%=K
    if n==1:
        a+=1
if N-1>1 and N-1 not in d:
    a+=len(divisor(N-1))-1
print(a)