#include<iostream>
#include<string>
#include<vector>
#include<algorithm>
#include<bitset>
#include<set>
#include<map>
#include<stack>
#include<queue>
#include<deque>
#include<list>
#include<iomanip>
#include<cmath>
#include<cstring>
#include<functional>
#include<cstdio>
#include<cstdlib>
#include<numeric>
using namespace std;

#define repr(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define rep(i, n) repr(i, 0, n)
#define INF 2e9
//#define MOD 1000000007
#define MOD 998244353
#define LINF (long long)4e18
#define jck 3.141592

const double EPS = 1e-10;

using ll = long long;
using Pi = pair<int,int>;
using Pl = pair<ll,ll>;



int main(){
    int n,z; cin >> n >> z;
    if(z == 1){
        cout << "No" << endl;
        return 0;
    }
    if(n == 1){
        bool ok = false;
        repr(x,1,z){
            if(z-x >= 1){
                ok = true;
                break;
            }
        }
        cout << (ok?"Yes":"No") << endl;
        return 0;
    }
    int zz = z;
    rep(i,n-1) zz *= z;
    repr(x,1,z)repr(y,1,z){
        ll xx = x;
        ll yy = y;
        bool ok = true;
        rep(i,n-1){
            xx *= x;
            if(xx > zz){
                ok = false;
                break;
            }
        }
        rep(i,n-1){
            yy *= y;
            if(yy > zz){
                ok = false;
                break;
            }
        }
        if(!ok) continue;
        if(xx+yy == zz){
            cout << "Yes" << endl;
            return 0;
        }
    }
    cout << "No" << endl;
}