/* -*- coding: utf-8 -*-
 *
 * 1218.cc:  No.1218 Something Like a Theorem - yukicoder
 */

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

/* constant */

const int MAX_Z = 1000000;

/* typedef */

/* global variables */

int ens[MAX_Z + 1];

/* subroutines */

int powi(int a, int n) {
  int pm = 1;
  while (n > 0) {
    if (n & 1) pm *= a;
    a *= a;
    n >>= 1;
  }
  return pm;
}

/* main */

int main() {
  int n, z;
  scanf("%d%d", &n, &z);

  for (int y = 1; y <= z; y++) ens[y] = powi(y, n);

  for (int x = 1; x < z; x++) {
    int y = lower_bound(ens, ens + z + 1, ens[z] - ens[x]) - ens;
    if (ens[x] + ens[y] == ens[z]) {
      puts("Yes");
      return 0;
    }
  }

  puts("No");
  return 0;
}