#include <bits/stdc++.h>
using namespace std;
int main(void){
    const int v[8][2] = {{-2,-1},{-2,1},{-1,-2},{-1,2},{1,2},{2,-1},{2,1},{1,-2}};
    queue<array<long long, 3>> que;
    set<pair<long long,long long>> s;
    long long x,y;
    cin>>x>>y;
    que.emplace(array<long long, 3>({{0,0,0}}));
    while(!que.empty()){
        auto tmp = que.front();que.pop();
        s.insert(make_pair(tmp[0],tmp[1]));
        if(tmp[2]==3) continue;
        for(int i=0;i<8;i++){
            que.push(array<long long, 3>({{tmp[0]+v[i][0],tmp[1]+v[i][1],tmp[2]+1}}));
        }
    }
    if (s.find(make_pair(x,y)) == s.end()) {
        cout<<"NO"<<endl;
    }else{
        cout<<"YES"<<endl;
    }
    return 0;
}