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 abc(n,i):
    if i==1:
        return 0
    while not n%i:
        n=n//i
    return not (n-1)%i
n=int(input())
e={}
for i in range(1,int(pow(n,0.5))+1):
    if not n%i:
        if abc(n,i):
            e[i]=0
        if abc(n,n//i):
            e[n//i]=0
n-=1

c=0
for i in range(1,int(pow(n,0.5))+1):
    if not n%i:
        c+=1
        if i!=n//i:
            c+=1
print(len(e)+c-1)
