#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define rrep(ri,n) for(int ri = (int)(n-1); ri >= 0; ri--)
#define rep2(i,x,n) for(int i = (int)(x); i < (int)(n); i++)
#define rrep2(ri,x,n) for(int ri = (int)(n-1); ri >= (int)(x); ri--)
#define repit(itr,x) for(auto itr = x.begin(); itr != x.end(); itr++)
#define rrepit(ritr,x) for(auto ritr = x.rbegin(); ritr != x.rend(); ritr++)
#define ALL(x) x.begin(), x.end()
using ll = long long;
using namespace std;

int main(){
  int n, z;
  cin >> n >> z;
  double ta = pow(z, n);
  // cerr << ta  << endl;
  bool f = false;
  for(ll i = 1; pow(i, n) < ta; i++){
    for(ll j = 1; pow(j, n) < ta; j++){
      if(pow(i, n) + pow(j, n) == ta){
        f = true;
        break;
      }
      if(pow(i,n) + pow(j, n) > ta) break;
    }
    if(f == true) break;
  }
  if(f == true) cout << "Yes" << endl;
  else cout << "No" << endl;
  return 0;
}