from fractions import Fraction
from sys import stdin


def prime_factors(n):
    ret = []
    apnd = ret.append
    while n >= 4:
        if n % 2:
            break
        else:
            n //= 2
            apnd(2)
    i = 3
    while n >= i * i:
        if n % i:
            i += 2
        else:
            n //= i
            apnd(i)
    apnd(n)
    return ret


def main():
    input = lambda: stdin.readline()[:-1]
    A, B = map(int, input().split())

    x = Fraction(A, B)
    n = prime_factors(x.denominator)

    if n[0] == 1:
        print("No")
        return

    for i in n:
        if i not in (2, 5):
            print("Yes")
            break
    else:
        print("No")


main()