#include<bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i,m,n) for(int i=m; i<int(n); ++i)
#define repll(i,m,n) for(ll i=m; i<ll(n); ++i)
#define all(a) (a).begin(), (a).end()
#define rall(a) (a).rbegin(), (a).rend()
#define fi first
#define se second

template<typename T> bool chmin(T& a, T b){ if(a > b){a = b; return true;} return false; }
template<typename T> bool chmax(T& a, T b){ if(a < b){a = b; return true;} return false; }

template<typename T> T gcd(T a, T b){ return a % b ? gcd(b, a % b) : b; }
template<typename T> T lcm(T a, T b){ return a / gcd(a, b) * b; }

int main(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    ll n, z;
    cin >> n >> z;

    if(n > 2LL){
        cout << "No" << endl;
    }else if(n == 1LL){
        cout << (z == 1LL ? "No" : "Yes") << endl;
    }else{
        for(ll x = 1LL; x < z; ++x){
            ll hi = 1000100LL, lo = 0LL, md;
            while(abs(hi - lo) > 1LL){
                md = (hi + lo) / 2LL;
                if(md*md > z*z - x*x) hi = md;
                else lo = md;
            }
            if(lo*lo + x*x == z*z && lo != 0LL){
                cout << "Yes" << endl;
                return 0;
            }
        }
        cout << "No" << endl;
    }

    return 0;
}