#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
#define FOR(i,m,n) for(int i=(m);i<(n);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) (v).begin(),(v).end()
using ll = long long;
const int INF = 0x3f3f3f3f;
const ll LINF = 0x3f3f3f3f3f3f3f3fLL;
const double EPS = 1e-8;
const int MOD = 1000000007;
// const int MOD = 998244353;
const int dy[] = {1, 0, -1, 0}, dx[] = {0, -1, 0, 1};
const int dy8[] = {1, 1, 0, -1, -1, -1, 0, 1}, dx8[] = {0, -1, -1, -1, 0, 1, 1, 1};
template <typename T, typename U> inline bool chmax(T &a, U b) { return a < b ? (a = b, true) : false; }
template <typename T, typename U> inline bool chmin(T &a, U b) { return a > b ? (a = b, true) : false; }
struct IOSetup {
  IOSetup() {
    cin.tie(nullptr);
    ios_base::sync_with_stdio(false);
    cout << fixed << setprecision(20);
  }
} iosetup;

int main() {
  int n, z; cin >> n >> z;
  if (n == 1) {
    cout << (z == 1 ? "No\n" : "Yes\n");
    return 0;
  }
  int r = 1;
  REP(_, n) r *= z;
  vector<int> xy;
  for (int x = 1; x * x <= r; ++x) {
    ll tmp = 1;
    REP(_, n) {
      tmp *= x;
      if (tmp > r) break;
    }
    if (tmp <= r) xy.emplace_back(tmp);
  }
  sort(ALL(xy));
  for (int e : xy) {
    int rem = r - e;
    if (*lower_bound(ALL(xy), rem) == rem) {
      cout << "Yes\n";
      return 0;
    }
  }
  cout << "No\n";
  return 0;
}