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 = input()

S = set()

# (a*K+1)*K**b==N

# b==0
# a*K+1==N
K = 1
while K*K<=N-1:
  if (N-1)%K==0:
    if K>1:
      S.add(K)
    if (N-1)/K>1:
      S.add((N-1)/K)
  K += 1

# b==1
# (a*K+1)*K==N
K = 1
while K*K<=N:
  if N%K==0:
    if K>1 and (N/K-1)%K==0:
      S.add(K)
    K2 = N/K
    if K2>1 and (N/K2-1)%K2==0:
      S.add(K2)
  K += 1

# b>=2
for b in range(2, 100):
  K = 2
  while True:
    if K**b>N:
      break
    if N%K**b==0 and (N/K**b-1)%K==0:
      S.add(K)
    K += 1

print len(S)
