#include <bits/stdc++.h>
using namespace std;

template <typename T> map<T, T> prime_factor_power(T n, T a)
{
  map<T, T> ret;
  for(T i = 2; i * i <= n; i++)
  {
    T count = 0;
    while(n % i == 0)
    {
      count += a;
      n /= i;
    }
    
    ret[i] = count;
    if(n == 0) break;
  }
  
  if(n != 1) ret[n] = a;
  return ret;
}

int main()
{
  int64_t X, A, Y, B;
  cin >> X >> A >> Y >> B;
  
  map<int64_t, int64_t> xpf = prime_factor_power(X, A);
  map<int64_t, int64_t> ypf = prime_factor_power(Y, B);
  for(auto y : ypf)
  {
    if(y.second > xpf[y.first])
    {
      cout << "No" << endl;
      return 0;
    }
  }
  
  cout << "Yes" << endl;
  return 0;
}