#include <bits/stdc++.h>
#include <atcoder/modint>
using namespace std;
using namespace atcoder;
using mint = modint998244353;
//using mint = modint1000000007;
using ll = long long;
using ld = long double;
using pll = pair<ll, ll>;
using tlll = tuple<ll, ll, ll>;
constexpr ll INF = 1LL << 60;
template<class T> bool chmin(T& a, T b) {if (a > b) {a = b; return true;} return false;}
template<class T> bool chmax(T& a, T b) {if (a < b) {a = b; return true;} return false;}
ll safemod(ll A, ll M) {return (A % M + M) % M;}
ll divfloor(ll A, ll B) {if (B < 0) {return divfloor(-A, -B);} return (A - safemod(A, B)) / B;}
ll divceil(ll A, ll B) {if (B < 0) {return divceil(-A, -B);} return divfloor(A + B - 1, B);}
#define FINALANS(A) do {cout << (A) << '\n'; exit(0);} while (false)

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

int main()
{
  ll X, A, Y, B;
  cin >> X >> A >> Y >> B;

  auto fX = factorize(X);
  auto fY = factorize(Y);
  for (auto pe : fX)
  {
    auto [p, e] = pe;
    fX[p] *= A;
  }
  for (auto pe : fX)
  {
    auto [p, e] = pe;
    fY[p] *= B;
  }

  for (auto pe : fY)
  {
    auto [p, e] = pe;
    //cerr << p << " " << fX[p] << " " << fY[p] << endl;
    if (fX.count(p) == 0 || fX[p] < fY[p])
      FINALANS("No");
  }
  FINALANS("Yes");
}