#include <bits/stdc++.h>
using namespace std;
#define rep2(i,m,n) for (int i = (m); i < (n); ++i)
#define rep(i,n) rep2(i,0,n)
#define dout(x) cerr << x << endl
typedef long long int ll;
typedef long double ld;
typedef pair<ll, ll> P;
template<typename T> struct V : vector<T> { using vector<T>::vector; };
V() -> V<int>;
V(size_t) -> V<int>;
template<typename T> V(size_t, T) -> V<T>;
template<typename T> vector<T> make_vec(size_t n, T a) { return vector<T>(n, a); }
template<typename... Ts> auto make_vec(size_t n, Ts... ts) { return vector<decltype(make_vec(ts...))>(n, make_vec(ts...)); }
template<typename T> ostream &operator<<(ostream &os, const vector<T> &v) { for (auto &e : v) os << e << ' '; return os; }
struct fast_ios { fast_ios(){ cin.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(20); }; } fast_ios_;
template<typename T> inline bool chmin(T &a, T b) { if (a > b) { a = b; return true; } return false; }
template<typename T> inline bool chmax(T &a, T b) { if (a < b) { a = b; return true; } return false; }
const int INF = 1e9;
const ll LINF = 1LL<<61;
const ll MOD = 1000000007;
const int M = 50;
typedef bitset<M> bs;

map<ll, int> factorize(ll x)
{
    map<ll, int> ret;
    for(ll i = 2; i*i <= x; i++)
    {
        while(x%i == 0)
        {
            ret[i]++;
            x/=i;
        }
    }
    if(x != 1) ret[x]++;
    return ret;
}

int main()
{
    ll a, b;
    cin >> a >> b;
    auto bunshi = factorize(a), bunbo = factorize(b);
    for(auto [p, e]:bunshi)
    {
        bunbo[p] -= e;
    }
    string ans = "No";
    for(auto [p, e]:bunbo)
    {
        if(p == 2 || p == 5) continue;
        if(e > 0) ans = "Yes";
    }
    cout << ans << endl;

    return 0;
}