#include <bits/stdc++.h>
using namespace std;
#define REP(i,a,n) for(int i=(a); i<(int)(n); i++)
#define rep(i,n) REP(i,0,n)
#define FOR(it,c) for(__typeof((c).begin()) it=(c).begin(); it!=(c).end(); ++it)
#define ALLOF(c) (c).begin(), (c).end()
typedef long long ll;
typedef unsigned long long ull;

vector<ll> factorize(ll x){
  vector<ll> ret;
  ll d, q;
  while(x>=4 && x%2==0){ret.push_back(2); x/=2;}
  d = 3; q = x/d;
  while(q>=d){
    if(x%d==0){ ret.push_back(d); x=q; }else{ d+=2; }
    q=x/d;
  }
  ret.push_back(x);
  return ret;
}

int main(){
  ll a, b;
  cin >> a >> b;

  vector<ll> resa = factorize(a);
  map<ll,ll> m;
  rep(i,resa.size()){
    if(resa[i] == 2 || resa[i] == 5) continue;
    m[resa[i]]++;
  }
  
  vector<ll> resb = factorize(b);
  rep(i,resb.size()){
    if(resb[i] == 2 || resb[i] == 5) continue;
    if(m.count(resb[i]) > 0){
      m[resb[i]]--;
    }else{
      cout << "Yes" << endl;
      return 0;
    }
  }
  
  cout << "No" << endl;
  
  return 0;
}