#include<iostream>
#include<queue>
#define ll long long

using namespace std;
typedef pair<ll,ll> P;
const int dx[] = {-2,-2,-1,-1,1,1,2,2};
const int dy[] = {1,-1,2,-2,2,-2,1,-1};

int main(){
    ll x,y;
    cin >> x >> y;
    queue<P> que;
    queue<int> num;
    que.push(P(0,0));
    num.push(0);
    while(!que.empty()){
        P cur = que.front();que.pop();
        int cnt = num.front();num.pop();
        if(cur.first == x && cur.second == y){
            cout << "YES" << endl;
            return 0;
        }
        
        if(cnt >= 3) continue;
        
        for(int i=0;i < 8;i++){
            int nx = cur.first + dx[i];
            int ny = cur.second + dy[i];
            que.push(P(nx,ny));
            num.push(cnt+1);
        }
    }
    cout << "NO" << endl;
    return 0;
}