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
N=int(input())
def factors(x):
   t=[]
   for i in range(2, int(x**0.5)+1):
       if x % i == 0:
           t.append(i)
           if x//i!=i:
               t.append(x//i)     
   return t
ans=2+len(factors(N-1))
fac=factors(N)
for i in fac:
    n=N
    while n%i==0:
        n=n//i
    n=n%i
    if n==1:
        ans+=1
if N==2:
    print(1)
else:  
    print(ans)
        
        

