//#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#define rep(i, n) for(int i=0; i<n; ++i)
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
using namespace std;
using ll = int64_t;
using ld = long double;
using P = pair<int, int>;
using vs = vector<string>;
using vi = vector<int>;
using vvi = vector<vi>;
template<class T> using PQ = priority_queue<T>;
template<class T> using PQG = priority_queue<T, vector<T>, greater<T> >;
const int INF = 0xccccccc;
const ll LINF = 0xcccccccccccccccLL;
template<typename T1, typename T2>
inline bool chmax(T1 &a, T2 b) {return a < b && (a = b, true);}
template<typename T1, typename T2>
inline bool chmin(T1 &a, T2 b) {return a > b && (a = b, true);}
template<typename T1, typename T2>
istream &operator>>(istream &is, pair<T1, T2> &p) { return is >> p.first >> p.second;}
template<typename T1, typename T2>
ostream &operator<<(ostream &os, const pair<T1, T2> &p) { return os << p.first << ' ' << p.second;}



//head

int x[1001];
int u = 1;

int main() {
  int n, z;
  scanf("%d%d", &n, &z);
  if(n >= 3) {
    printf("No\n");
    return 0;
  }
  if(n == 1) {
    if(z > 1) printf("Yes\n");
    else printf("No\n");
    return 0;
  }
  z *= z;
  for(int i = 1; i*i < z; i++) {
    u++;
    x[i] = i*i;
  }
  for(int i = 1; x[i] < (z>>1); i++) {
    auto itr = lower_bound(x, x+u, z-x[i]);
    if(*itr+x[i] == z) {
      printf("Yes\n");
      return 0;
    }
  }
  printf("No\n");
}