#include<iostream>
#include<iomanip>
#include<cmath>
#include<string>
#include<cstring>
#include<vector>
#include<list>
#include<algorithm>
#include<map>
#include<set>
#include<queue>
#include<stack>
using namespace std;
typedef long long ll;
#define fi first
#define se second
#define mp make_pair
#define mt make_tuple
#define pqueue priority_queue
const int inf=1e9+7;
const ll mod=1e9+7;
const ll mod1=998244353;
const ll big=1e18;
const double PI=2*asin(1);

ll gcd(ll a, ll b) {
  ll v0=a, v1=b, v2=v0%v1;
  while(v2>0) {
    v0 = v1;
    v1 = v2;
    v2 = v0%v1;
  }
  return v1;
}

int main() {
  ll A, B;
  cin>>A>>B;
  while(A%2==0) A /= 2;
  while(A%5==0) A /= 5;
  while(B%2==0) B /= 2;
  while(B%5==0) B /= 5;
  ll tmp = gcd(A, B);
  if(B/tmp==1) cout<<"No"<<endl;
  else cout<<"Yes"<<endl;
}