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

map<long, int> pf(long n) {
  map<long, int> ma;
  for (long i = 2; i * i <= n; i++) {
    while (n % i == 0) ma[i]++, n /= i;
  }
  if (n != 1) ma[n]++;
  return ma;
}

int main() {
  long a, b;
  cin >> a >> b;
  long g = gcd(a, b);
  a /= g;
  b /= g;
  for (auto [a, b] : pf(b)) if (a != 2 && a != 5) return cout << "Yes" << "\n", 0;
  cout << "No" << "\n";
}