#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define ALL(v) v.begin(), v.end()
typedef long long ll;

#include <bits/stdc++.h>
using namespace std;

int main(){
  ll a,b;
  cin>>a>>b;
  
  map<ll,ll> m1,m2;
  
  for(ll i=2;i*i<=a;i++){
    while(a%i==0){
      m1[i]++;
      a/=i;
    }
  }
  if(a!=1) m1[a]++;
  
  for(ll i=2;i*i<=b;i++){
    while(b%i==0){
      m2[i]++;
      b/=i;
    }
  }
  if(b!=1) m2[b]++;
  
  bool flag=true;
  for(auto x:m2){
    if(x.first==2) continue;
    if(x.first==5) continue;
    if(x.second>m1[x.first]) flag=false;
  }
  if(flag) cout<<"No"<<endl;
  else cout<<"Yes"<<endl;

  return 0;
}