#include using namespace std; #define SZ(x) (int)(x.size()) #define REP(i, n) for(int i=0;i<(n);++i) #define FOR(i, a, b) for(int i=(a);i<(b);++i) #define RREP(i, n) for(int i=(int)(n);i>=0;--i) #define RFOR(i, a, b) for(int i=(int)(a);i>=(int)(b);--i) #define ALL(a) (a).begin(),(a).end() #define DUMP(x) cerr<<#x<<" = "<<(x)<; using vvi = vector; using vll = vector; using vvll = vector; using P = pair; const double eps = 1e-8; const ll MOD = 1000000007; const int INF = INT_MAX / 2; const ll LINF = LLONG_MAX / 2; template bool chmax(T1 &a, const T2 &b) { if(a < b) {a = b; return true;} return false; } template bool chmin(T1 &a, const T2 &b) { if(a > b) {a = b; return true;} return false; } template ostream& operator<<(ostream &os, const pair p) { os << p.first << ":" << p.second; return os; } template ostream &operator<<(ostream &os, const vector &v) { REP(i, SZ(v)) { if(i) os << " "; os << v[i]; } return os; } int main() { cin.tie(0); ios::sync_with_stdio(false); cout << fixed << setprecision(10); int n, z; cin >> n >> z; if(n == 1) { if(z != 1) { cout << "Yes" << endl; } else { cout << "No" << endl; } } else if(n == 2) { bool ok = false; for(int x = 1; 2 * x * x <= z * z; ++x) { if(ok) break; for(int y = 1; y * y <= z * z - x * x; ++y) { if(x * x + y * y == z * z) { ok = true; break; } } } cout << (ok ? "Yes" : "No") << endl; } else if(n >= 3) { cout << "No" << endl; return 0; } return 0; }