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):
  ret=[]
  for i in range(1,int(n**0.5)+1):
    if n%i==0:
      a,b=i,n//i
      if a!=b:
        ret+=a,
        ret+=b,
      else:
        ret+=a,
  return sorted(ret)

def f(n):
  return divisor(n)[1:]

def solve(n):
  ans=f(n-1)
  for k in f(n):
    N=n
    while N>=k:
      if N%k==0:N=N//k
      else:N=N%k
    if N==1:ans+=k,
  print(len(ans))
  return 0

solve(int(input()))