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 devisor(n):
    cnt=0
    d=[]
    for i in range(1,round(n**0.5)+1):
        if n%i==0:
            cnt+=1
            d.append(i)
            if n//i!=i:
                cnt+=1
                d.append(n//i)
    return cnt,d

N=int(input())
ans=devisor(N-1)[0]-1

D=devisor(N)[1]

for d in D:
    if d==1:
        continue
    n=N
    while n%d==0:
        n=n//d
    if n%d==1:
        ans+=1

print(ans)