#include <algorithm>
#include <array>
#include <cmath>
#include <cstdio>
#include <deque>
#include <iomanip>
#include <iostream>
#include <numeric>
#include <optional>
#include <queue>
#include <set>
#include <stack>
#include <unordered_map>
#include <unordered_set>
#include <vector>

using namespace std;

vector<pair<int32_t, int64_t>> f(int64_t x) {
    vector<pair<int32_t, int64_t>> ps;
    for (int64_t i = 2; i * i <= x; ++i) {
        int32_t c = 0;
        while (x % i == 0) {
            ++c;
            x /= i;
        }
        if (c > 0)
            ps.push_back({i, c});
    }
    if (x > 1)
        ps.push_back({x, 1});
    return ps;
}

int main() {
    int32_t a, b;
    cin >> a >> b;
    auto aps = f(a), bps = f(b);
    for (auto &&[p, c] : aps) {
        c *= b;
    }
    for (auto &&[p, c] : bps) {
        c *= a;
    }
    sort(aps.begin(), aps.end());
    sort(bps.begin(), bps.end());
    cout << (aps == bps ? "Yes" : "No") << endl;
    return 0;
}