A, B = map(int, input().split())

if A % B != 0:
    print(0)
else:
    m = A // B

    def count_factors(n):
        if n == 0:
            return 0
        res = 1
        # Handle even factor 2
        exp = 0
        while n % 2 == 0:
            exp += 1
            n //= 2
        if exp > 0:
            res *= (exp + 1)
        # Handle odd factors
        i = 3
        while i * i <= n:
            exp = 0
            while n % i == 0:
                exp += 1
                n //= i
            if exp > 0:
                res *= (exp + 1)
            i += 2
        # Remaining prime factor
        if n > 1:
            res *= 2
        return res

    print(count_factors(m))