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=n
yakusu=[]
for i in range(1,int(n**0.5)+1):
	if n%i==0:
		yakusu.append(i)
		if i!=n//i:
			yakusu.append(n//i)
p-=1
yakusu_1=[]
for i in range(1,int(p**0.5)+1):
	if p%i==0:
		yakusu_1.append(i)
		if i!=p//i:
			yakusu_1.append(p//i)
ans=len(yakusu_1)-1
for x in yakusu:
	r=n
	if x!=1:
		while r%x==0:
			r//=x
		if (r-1)%x==0:
			ans+=1
print(ans)