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())
ans=0
x = N-1
for i in range(2,int(x**(1/2))+1):
  if x%i==0:
    ans+=2
  
if int(x**(1/2))**2==x:
  ans-=1


for i in range(2,int(N**(1/2))+1):
  a = N
  if a%i==0:
    while a%i==0:
      a//=i
    if a%i==1:
      ans+=1
      
    b = N//i
    if b==i:
      continue
    a = N
    while a%b==0:
      a//=b
    if a%i==1:
      ans+=1
    
print(ans+2)