def prime_table(n):
  n+=1
  table=[i if i%2 else 2 for i in range(n)]
  for i in range(3,n,2):
    if table[i]==i:
      for j in range(i*i,n,2*i):
        if table[j]==j:
          table[j]=i
  return table


def prime_fact(n,table):
  p=[]
  while n!=1:
    pp=table[n]
    if not(pp==2 or pp==5):
      p.append(pp)
    n//=pp
  return p
def gcd(a,b):
  while b:
    a,b=b,a%b
  return a

a,b=map(int,input().split())
b//=gcd(a,b)
if len(prime_fact(b,prime_table(b))):
  print("Yes")
else:
  print("No")