from collections import defaultdict, Counter
A, B = map(int, map(int, input().split()))

def prime_factorize(n): # O(√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

left = defaultdict(int)
for prime, cnt in Counter(prime_factorize(A)).items():
    left[prime] = cnt*B

right = defaultdict(int)
for prime, cnt in Counter(prime_factorize(B)).items():
    right[prime] = cnt*A

if left == right:
    print('Yes')
else:
    print('No')