#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
typedef long long int ll;
typedef long double ld;
#define FOR(i,l,r) for(ll i=l;i<r;i++)
#define REP(i,n) FOR(i,0,n)
#define RFOR(i,l,r) for(ll i=r-1;i>=l;i--)
#define RREP(i,n) RFOR(i,0,n)
#define ALL(x) x.begin(),x.end()
#define P pair<ll,ll>
#define F first
#define S second
#define BS(A,x) binary_search(ALL(A),x)
#define LB(A,x) (ll)(lower_bound(ALL(A),x)-A.begin())
#define UB(A,x) (ll)(upper_bound(ALL(A),x)-A.begin())
#define COU(A,x) UB(A,x)-LB(A,x)
template<typename T>using min_priority_queue=priority_queue<T,vector<T>,greater<T>>;
using mint=modint1000000007;
//using mint=modint998244353;
void chmax(ll&a,ll b){a=max(a,b);}
signed main(){
  ll X,A,Y,B;cin>>X>>A>>Y>>B;
  vector<P>fx,fy;
  ll d=2;
  while(d*d<=X){
    if(X%d==0){
      ll e=0;
      while(X%d==0){X/=d;e++;}
      fx.push_back(P(d,e*A));
    }
    d++;
  }
  if(X>1)fx.push_back(P(X,A));
  d=2;
  while(d*d<=Y){
    if(Y%d==0){
      ll e=0;
      while(Y%d==0){Y/=d;e++;}
      fy.push_back(P(d,e*B));
    }
    d++;
  }
  if(Y>1)fy.push_back(P(Y,B));
  for(auto i:fy){
    if(LB(fx,i)==fx.size()){cout<<"No"<<endl;return 0;}
    auto j=fx[LB(fx,i)];
    if(j.F!=i.F){cout<<"No"<<endl;return 0;}
  }
  cout<<"Yes"<<endl;
  return 0;
}