#ifdef LOCAL #define _GLIBCXX_DEBUG #define __clock__ #else #pragma GCC optimize("Ofast") #endif #include using namespace std; using ll = long long; using VI = vector; using VV = vector; using VS = vector; using PII = pair; // #define INT128 // 必要なら有効化してください #ifdef INT128 using LL = __int128; #endif // tourist set template string to_string(pair p); template string to_string(tuple p); template string to_string(tuple p); string to_string(const string& s) { return '"' + s + '"'; } string to_string(const char* s) { return to_string((string) s); } string to_string(bool b) { return (b ? "true" : "false"); } string to_string(char c){ string s = {c}; return s; } // LL #ifdef INT128 // input istream& operator>>(istream& is, LL& v) { string s; is >> s; v = 0; for (int i = 0; i < (int)s.size(); i++) { if (isdigit(s[i])) { v = v * 10 + s[i] - '0'; } } if (s[0] == '-') { v *= -1; } return is; } std::ostream &operator<<(std::ostream &dest, LL value) { std::ostream::sentry s(dest); if (s) { LL tmp = value < 0 ? -value : value; char buffer[128]; char *d = std::end(buffer); do { --d; *d = "0123456789"[tmp % 10]; tmp /= 10; } while (tmp != 0); if (value < 0) { --d; *d = '-'; } int len = std::end(buffer) - d; if (dest.rdbuf()->sputn(d, len) != len) { dest.setstate(std::ios_base::badbit); } } return dest; } string to_string(LL v){ stringstream ss; ss << v; return ss.str(); } #endif // LL string to_string(vector v) { bool first = true; string res = "{"; for (int i = 0; i < static_cast(v.size()); i++) { if (!first) { res += ", "; } first = false; res += to_string(v[i]); } res += "}"; return res; } template string to_string(bitset v) { string res = ""; for (size_t i = 0; i < N; i++) { res += static_cast('0' + v[i]); } return res; } template string to_string(A v) { bool first = true; string res = "{"; for (const auto &x : v) { if (!first) { res += ", "; } first = false; res += to_string(x); } res += "}"; return res; } template string to_string(pair p) { return "(" + to_string(p.first) + ", " + to_string(p.second) + ")"; } template string to_string(tuple p) { return "(" + to_string(get<0>(p)) + ", " + to_string(get<1>(p)) + ", " + to_string(get<2>(p)) + ")"; } template string to_string(tuple p) { return "(" + to_string(get<0>(p)) + ", " + to_string(get<1>(p)) + ", " + to_string(get<2>(p)) + ", " + to_string(get<3>(p)) + ")"; } void debug_out() { cerr << '\n'; } template void debug_out(Head H, Tail... T) { cerr << " " << to_string(H); debug_out(T...); } #ifdef LOCAL #define debug(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__) #else #define debug(...) 42 #endif // tourist set end templatebool chmax(T &a, const T &b) { if (abool chmin(T &a, const T &b) { if (b()) #define MP make_pair #define p_yes() p("Yes") #define p_no() p("No") #define p_possible() p("Possible") #define p_impossible() p("Impossible") void yes(){p_yes(); exit(0);} void no(){p_no(); exit(0);} void possible(){p_possible(); exit(0);} void impossible(){p_impossible(); exit(0);} ll SUM(VI& V){ return accumulate(ALL(V), 0LL); } ll MIN(VI& V){return *min_element(ALL(V));} ll MAX(VI& V){return *max_element(ALL(V));} void print_vector(VI& V, ll offset=0){ ll n = V.size(); rep(i, n){ if(i) cout << ' '; cout << V[i]+offset; } cout << endl; } ll gcd(ll a,ll b){ if(b == 0) return a; return gcd(b,a%b); } ll lcm(ll a,ll b){ ll g = gcd(a,b); return a / g * b; } // long double using ld = long double; // #define EPS (1e-14) constexpr ld EPS = 1e-14; // #define equals(a,b) (fabs((a)-(b)) < EPS) constexpr bool equals(ld a, ld b){return fabs((a)-(b)) < EPS;} // 小さい順に取り出すpriority queue using inverse_priority_queue = priority_queue, greater >; int popcount(ll t){ return __builtin_popcountll(t); } const ll mod = 1e9 + 7; // const ll mod = 998244353; const ll inf = 4e18; // LLONG_MAX = 9223372036854775807 (atcoder, codeforces) const double PI = acos(-1); // [a/b] (繰り上げ) ll ceil_div(ll a, ll b){ return (a+b-1)/b; } ll ll_pow(ll a, ll n){ ll ans = 1; FOR(i, 0, n){ ans *= a; } return ans; } // modなし // snuke's mint // auto mod int // https://youtu.be/L8grWxBlIZ4?t=9858 // https://youtu.be/ERZuLAxZffQ?t=4807 : optimize // https://youtu.be/8uowVvQ_-Mo?t=1329 : division // const int mod = 1000000007; struct mint { ll x; // using ll = long long; mint(ll x=0):x((x%mod+mod)%mod){} mint operator-() const { return mint(-x);} mint& operator+=(const mint a) { if ((x += a.x) >= mod) x -= mod; return *this; } mint& operator-=(const mint a) { if ((x += mod-a.x) >= mod) x -= mod; return *this; } mint& operator*=(const mint a) { (x *= a.x) %= mod; return *this; } mint operator+(const mint a) const { mint res(*this); return res+=a; } mint operator-(const mint a) const { mint res(*this); return res-=a; } mint operator*(const mint a) const { mint res(*this); return res*=a; } mint pow(ll t) const { if (!t) return 1; mint a = pow(t>>1); a *= a; if (t&1) a *= *this; return a; } // for prime mod mint inv() const { return pow(mod-2); } mint& operator/=(const mint a) { return (*this) *= a.inv(); } mint operator/(const mint a) const { mint res(*this); return res/=a; } }; // ※双方向 // N : 頂点数 // M : 辺数 // return vector> VV load_graph(ll N, ll M){ VV G(N); rep(i,M){ ll a,b;cin>>a>>b; a--;b--; G[a].push_back(b); G[b].push_back(a); } return G; } VV load_tree(ll N){ return load_graph(N, N-1); } VI loadV(ll N){ VI A(N); rep(i,N)cin>>A[i]; return A; } //#include //using namespace atcoder; // 忘れがち // for codeforces void solve(){ ll N; cin>>N; VI A(N); rep(i, N){ cin >> A[i]; } } // 計算量O(√N) // なのでN=10^18だと間に合いません // long long -> intとすると4倍(?)速くなります // N=10^4, A=10^9の時は必要でしょう // 素因数分解 // その素因数が何個あるかのmapを返す map factorize(ll n){ map mp; ll sq = sqrt(n); FOR(i, 2, sq+1){ while(n%i==0){ mp[i]++; n/=i; } } // 残り if(n!=1){ mp[n]++; } return mp; } // 約数の種類数 // 6 => 1, 2, 3, 6なので4 ll yaku(ll n){ auto mp = factorize(n); ll ret = 1; for(auto pa : mp){ ret *= (pa.second+1); } return ret; } // 約数一覧を返します vector calc_devisors(ll a){ vector ret; for(ll i=1; i*i<=a; i++){ if(a%i!=0) continue; ret.push_back(i); ll another = a/i; if(i!=another) ret.push_back(another); } sort(ALL(ret), greater()); // 使いやすいように大きい順にソートしておく return ret; } int main(){ cin.tie(0); ios::sync_with_stdio(false); // input ll x,a,y,b; cin>>x>>a>>y>>b; // if(y==1)yes(); // y>1 // if(x%y!=0)no(); // x%y==0 auto mpX = factorize(x); auto mpY = factorize(y); debug(mpX); debug(mpY); // 分母側をすべてつぶせるか? for(auto pa : mpY){ ll v = pa.first; ll c = pa.second; if(mpX.count(v)==0)no(); ll cntX = mpX[v]*a; if(cntX