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

n = int(input())

#K is a divisor of N
ans = 0
for x in Divisor(n):
    if x == 1: continue
    tmp = n
    while (tmp % x == 0):
        tmp /= x
    tmp %= x    
    if tmp == 1: 
      ans += 1
      
#K is not a divisor of N (except 1)
ans += len(Divisor(n-1))-1
print(ans)