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())
P=0
def f(x):
  r=[]
  for i in range(1,int(x**0.5)+1):
    if x%i==0:
      r.append(i)
      if x!=i*i:
        r.append(x//i)
  return r

A=f(N)
M=0
for i in range(len(A)):
  if A[i]==1:
    continue
  M=N
  while M%A[i]==0:
    M//=A[i]
  if M%A[i]==1:
    P+=1
P+=len(f(N-1))-1
print(P)