import math def factorization(n): arr = [] temp = n for i in range(2, int(-(-n**0.5//1))+1): if temp%i==0: cnt=0 while temp%i==0: cnt+=1 temp //= i arr.append([i, cnt]) if temp!=1: arr.append([temp, 1]) if arr==[]: arr.append([n, 1]) return arr a, b = map(int, input().split()) g = math.gcd(a, b) a//=g b//=g f = factorization(b) for p, e in f: if p not in [1, 2, 5]: print("Yes") exit() print("No")