#include"bits/stdc++.h"

using namespace std;
#define REP(k,m,n) for(int (k)=(m);(k)<(n);(k)++)
#define rep(i,n) REP((i),0,(n))
using ll = long long;
using pll = pair<ll, ll>;
using tp3 = tuple<ll, ll, ll>;
constexpr int INF = 1 << 28;
constexpr ll INFL = 1ll << 60;
constexpr int dh[4] = { 0,1,0,-1 };
constexpr int dw[4] = { -1,0,1,0 };
bool isin(const int H, const int W, const int h, const int w) {
    return 0 <= h && h < H && 0 <= w && w < W;
}
// ============ template finished ============

bool only_have_2_5(ll num) {
    while (num % 2 == 0) num /= 2;
    while (num % 5 == 0)num /= 5;
    return num == 1;
}

int main()
{
    ll a, b;
    cin >> a >> b;
    ll g = gcd(a, b);
    b /= g;
    cout << (only_have_2_5(b) ? "No" : "Yes") << endl;
    return 0;
}