import collections
def prime_factorize(n):
    a = []
    while n % 2 == 0:
        a.append(2)
        n //= 2
    f = 3
    while f * f <= n:
        if n % f == 0:
            a.append(f)
            n //= f
        else:
            f += 2
    if n != 1:
        a.append(n)
    return a

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

AC = collections.Counter(prime_factorize(A))
BC = collections.Counter(prime_factorize(B))
P = BC-AC
flag = False
for i in P.keys():
    if not (i==2 or i==5):
        flag = True
if flag:
    print('Yes')
else:
    print('No')