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 f(x):
  m=int(x**(1/2))
  ret=set()
  for i in range(1,m+1):
    if x%i==0:
      ret.add(i)
      ret.add(x//i)
  return ret


ans=set()
for i in f(n):
  if i==1:
    continue
  g=n
  while g%i==0:
    g=g//i
  if g%i==1:
    ans.add(i)

for j in f(n-1):
  if j==1:
    continue
  if j in ans:
    continue
  ans.add(j)
  
print(len(ans))