#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; ++i)
typedef long long ll;
using namespace std;

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

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

    auto mp1 = prime_factor(a);
    auto mp2 = prime_factor(b);

    for (auto &p : mp1) {
        p.second *= b;
    }
    for (auto &p : mp2) {
        p.second *= a;
    }

    if (mp1.size() == mp2.size()) {
        bool flag = true;
        for (auto p : mp1) {
            if (p.second != mp2[p.first]) {
                flag = false;
                break;
            }
        }
        cout << (flag ? "Yes\n" : "No\n");
    } else
        cout << "No\n";

    return 0;
}