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 divisors(x):
    div=[]
    for i in range(1,x+1):
        if i*i>x:
            break
        if x%i==0:
            div.append(i)
            if x%i!=i:
                div.append(x//i)
    return div

n=int(input())
ans=set([])
for k in divisors(n):
    if k==1:continue
    N=n
    while  N%k==0:
        N//=k
    N%=k
    if N==1:
        ans.add(k)

for j in divisors(n-1):
    if j==1:continue
    ans.add(j)
print(len(ans))