#include <bits/stdc++.h>
using namespace std;
using ll=long long;
using ull=unsigned long long;
using pll=pair<ll,ll>;
using tll=tuple<ll,ll,ll>;
using ld=long double;
constexpr ll INF=(1ll<<60);
#define rep(i,n) for (ll i=0;i<(ll)(n);i++)
#define replr(i,l,r) for (ll i=(ll)(l);i<(ll)(r);i++)
#define all(v) v.begin(),v.end()
#define len(v) ((ll)v.size())
template<class T> inline bool chmin(T &a,T b){
    if(a>b){
        a=b;
        return true;
    }
    return false;
}
template<class T> inline bool chmax(T &a,T b){
    if(a<b){
        a=b;
        return true;
    }
    return false;
}
template<class T> T binary_search(auto f,T ok,T ng){
    while(1<abs(ok-ng)){
        T mid=midpoint(ok,ng);
        if(f(mid)) ok=mid;
        else ng=mid;
    }
    return ok;
}
int main(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    ll ax,ay,bx,by;
    char c;
    cin >> ax >> c >> ay >> bx >> c >> by;
    if(bx==0&&by==0){
        cout << "Yes\n";
        return 0;
    }
    if(bx<0){
        if(ax==1){
            cout << "Yes\n";
        }else{
            cout << "No\n";
        }
        return 0;
    }
    assert(0);
    ll r=1;
    rep(i,len(to_string(by))) r*=10;
    ll b=bx*r+by;
    
    ll p=r/gcd(r,b);
    ll a=ax,x=a;
    replr(i,2,100001){
        ll cnt=0;
        while(x%i==0){
            x/=i;
            cnt++;
        }
        if(cnt%p!=0){
            cout << "No\n";
            return 0;
        }
    }
    cout << "Yes\n";
}