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 waru(n,k):
    while(n >= k):
        if(n%k == 0):
            n //= k
        else:
            n %= k
    if(n == 1):
        return 1
    else:
        return 0
n = int(input())
p = 0
if(n < 100):
    for i in range(2,n+1):
        p += waru(n,i)
    print(p)
else:
    for i in range(2,int(n**0.5)+1):
        if(n%i == 1):
            p += 1
        p += waru(n,i)
    if(int((n-1)**0.5)**2 == n-1):
        p -= 1
    print(p+2)