#include <bits/stdc++.h>
#include <iostream>
#include <ctime>
using namespace std;
#define _LL long long
#define rep(i, n) for (_LL i = 0; i < (_LL)(n); i++)
#define vecrep(itr, v) for (auto itr = (v).begin(); itr != (v).end(); itr++)

int getpown(int a, int n)
{
    int ret = 1;
    rep(i, n) ret *= a;
    return ret;
}

// n乗がkになるものが存在するか
bool check(int k, int n, int z)
{
    int l = 1;
    int r = z;
    while( r > l + 1 )
    {
        int m = (l + r) / 2;
        int mn = getpown(m, n);
        if( mn == k ) return true;
        if( mn > k )
        {
            r = m;
        }
        else
        {
            l = m;
        }
    }
    int ln = getpown(l, n);
    return ln == k;
}

int main()
{
    int n, z; cin >> n >> z;
    int zn = getpown(z, n);
    rep(x, z)
    {
        if( x == 0 ) continue;
        int xn = getpown(x, n);
        if( check( zn - xn, n, z) )
        {
            cout << "Yes" << endl;
            return 0;
        }
    }
    cout << "No" << endl;
    return 0;    
}