#include <bits/stdc++.h>
#define rep(i,n) for(ll i = 0; i < (n); ++i)
#define srep(i,s,t) for (ll i = s; i < t; ++i)
#define drep(i,n) for(ll i = (n)-1; i >= 0; --i)
using namespace std;
typedef long long int ll;
typedef pair<int,int> P;
#define yn {puts("Yes");}else{puts("No");}
#define MAX_N 200005

int main() {
    ll n, z;
    cin >> n >> z;
    ll w = 1;
    rep(i,n) w *= z;

    if(n == 1){
        if(z>=2)yn;
        return 0;
    }

    srep(i,1,1100){
        srep(j,1,1100){
            ll x = 1, y = 1;
            int ng = 0;
            rep(k,n){
                x *= i;
                if(x >= w){
                    ng = 1;
                    break;
                }
            }
            rep(k,n){
                y *= j;
                if(x + y > w){
                    ng = 1;
                    break;
                }
            }
            if(ng == 0 && x+y==w){
                cout << "Yes" << endl;
                return 0;
            }
            if(ng) break;
        }
    }
    cout << "No" << endl;
    return 0;
}