import math
N, K = map(int, input().split())

def make_divisors(n):
    lower_divisors , upper_divisors = [], []
    i = 1
    while i*i <= n:
        if n % i == 0:
            lower_divisors.append(i)
            if i != n // i:
                upper_divisors.append(n//i)
        i += 1
    return lower_divisors + upper_divisors[::-1]

if K == 0:
    exit(print(len(make_divisors(N))))

g = math.gcd(N, K)
N //= g
K //= g
print(len(make_divisors(N - K)) - 1)