def gcd(a: int, b: int) -> int:
    """a, bの最大公約数(greatest common divisor: GCD)を求める
    計算量: O(log(min(a, b)))
    """
    while b:
        a, b = b, a % b
    return a


a, b = map(int, input().split())


gcd_ = gcd(a, b)
a //= gcd_
b //= gcd_

while b % 2 == 0:
    b //= 2
while b % 5 == 0:
    b //= 5

if b == 1:
    print("No")
else:
    print("Yes")