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())
D={}
for i in range(2,int(N**0.5)+1):
    n=N
    #print(i,n)
    while n%i==0 and n!=i:
        n//=i
    #print(i,n)
    if n==i or n%i==1:
        D[i]=1
        #print("ANS",i,n)
#print(D)
N1=N-1
for i in range(1,int(N1**0.5)+1):
    if N1%i==0:
        D[i]=1
        D[N1//i]=1
#print(D)
print(len(D))
        
