#include <bits/stdc++.h>
using namespace std;
using ll=long long;
using ld=long double;
const ll ILL=2167167167167167167;
const int INF=2100000000;
#define rep(i,a,b) for (int i=(int)(a);i<(int)(b);i++)
#define all(p) p.begin(),p.end()
template<class T> using _pq = priority_queue<T, vector<T>, greater<T>>;
template<class T> ll LB(vector<T> &v,T a){return lower_bound(v.begin(),v.end(),a)-v.begin();}
template<class T> ll UB(vector<T> &v,T a){return upper_bound(v.begin(),v.end(),a)-v.begin();}
template<class T> bool chmin(T &a,T b){if(a>b){a=b;return 1;}else return 0;}
template<class T> bool chmax(T &a,T b){if(a<b){a=b;return 1;}else return 0;}
template<class T> void So(vector<T> &v) {sort(v.begin(),v.end());}
template<class T> void Sore(vector<T> &v) {sort(v.begin(),v.end(),[](T x,T y){return x>y;});}
bool yneos(bool a,bool upp=0){if(a){cout<<(upp?"YES\n":"Yes\n");}else{cout<<(upp?"NO\n":"No\n");}return a;}
template<class T> void vec_out(vector<T> &p,int ty=0){
    if(ty==2){cout<<'{';for(int i=0;i<(int)p.size();i++){if(i){cout<<",";}cout<<'"'<<p[i]<<'"';}cout<<"}\n";}
    else{if(ty==1){cout<<p.size()<<"\n";}for(int i=0;i<(int)(p.size());i++){if(i) cout<<" ";cout<<p[i];}cout<<"\n";}}
template<class T> T vec_min(vector<T> &a){assert(!a.empty());T ans=a[0];for(auto &x:a) chmin(ans,x);return ans;}
template<class T> T vec_max(vector<T> &a){assert(!a.empty());T ans=a[0];for(auto &x:a) chmax(ans,x);return ans;}
template<class T> T vec_sum(vector<T> &a){T ans=T(0);for(auto &x:a) ans+=x;return ans;}
int pop_count(long long a){int res=0;while(a){res+=(a&1),a>>=1;}return res;}



void solve();
// CYAN / FREDERIC
int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    int t = 1;
    // cin >> t;
    rep(i, 0, t) solve();
}

void solve(){
    string A, B;
    cin >> A >> B;
    if (A == "1.0000"){
        cout << "Yes\n";
        return;
    }
    if (B[0] == '-'){
        cout << "No\n";
        return;
    }
    if (B == "0.0000"){
        cout << "Yes\n";
        return;
    }
    rep(i, 0, 4){
        if (A[(int)(A.size()) - i - 1] != '0'){
            cout << "No\n";
            return;
        }
    }
    auto f = [&](string s) -> ll {
        ll res = 0;
        for (auto c : s) if (c != '.'){
            res *= 10;
            res += c - '0';
        }
        return res;
    };
    ll a = f(A), b = f(B);
    auto g = [&](ll a, ll m) -> bool {
        ll l = 1, r = (1ll << 30);
        while (r - l > 1){
            ll tmp = (l + r) / 2;
            ll v = a;
            rep(d, 0, m) v /= tmp;
            if (v == 0) r = tmp;
            else l = tmp;
        }
        rep(d, 0, m){
            if (a % l) return false;
            a /= l;
        }
        return a == 1;
    };
    for (int d = 30; d > 1; d--){
        if (g(a / 10000, d)){
            b *= d;
            break;
        }
    }
    yneos(b % 10000 == 0 || a == 10000);
}