#include <iostream>
#include <vector>
#include <queue>
#include <set>
using namespace std;
typedef pair<int,int> P;
struct dta{
    int nw;
    int x;
    int y;
};
P pos[8] = {{-2,-1},{-2,1},{-1,-2},{-1,2},{1,-2},{1,2},{2,-1},{2,1}};
int main(){
    set<P> A;
    queue<dta> Z;
    Z.push({0,0,0});
    while(!Z.empty()){
        dta K = Z.front();Z.pop();
        A.insert({K.x,K.y});
        if(K.nw == 3){
            continue;
        }
        for(auto x:pos){
            Z.push({K.nw+1,K.x+x.first,K.y+x.second});
        }
    }
    int x,y;cin>>x>>y;
    if(A.find({x,y}) != A.end())cout << "YES" << endl;
    else cout << "NO" << endl;
}