#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)(n);i++)
using namespace std;
using ll = long long ;
using P = pair<int,int> ;
using pll = pair<long long,long long>;
constexpr int INF = 1e9;
constexpr long long LINF = 1e17;
constexpr int MOD = 1000000007;
constexpr double PI = 3.14159265358979323846;
vector<int> dx = {-2,-2,-1,-1,1,1,2,2};
vector<int> dy = {-1,1,-2,2,-2,2,-1,1};

vector<P> exist;

void dfs(int x,int y,int c=0){
    if(c==4) return;
    else exist.push_back(P(x,y));

    rep(i,8){
        int nowx = x + dx[i];
        int nowy = y + dy[i];
        dfs(nowx,nowy,c+1);
    }

    return;
}

int main(){
    dfs(0,0);
    int x,y;
    cin >> x >> y;
    bool ok = false;
    rep(i,exist.size()){
        if(exist[i].first == x && exist[i].second == y) ok = true;
    }
    cout << (ok?"YES":"NO") << endl;
    return 0;
}