#include using namespace std; #define rep(i,n) for(int i = 0; i < (n);i++) #define sz(x) int(x.size()) typedef long long ll; typedef long double ld; typedef pair P; map< ll, int > prime_factor(ll n) { map< ll, int > res; for(ll i = 2; i * i <= n; i++) { while(n % i == 0) { res[i]++; n /= i; } } if(n != 1) res[n] = 1; return res; } int main() { ll a, b; cin >> a >> b; b /= gcd(a, b); auto d = prime_factor(b); int ok = 0; for (auto e : d) { if (!(e.first == 2 || e.first == 5)) ok = 1; } cout << (ok ? "Yes" : "No") << endl; return 0; }