#include <iostream>
#include <queue>
#include <utility>
using namespace std;
int main(){
  int X,Y; cin >> X >> Y;
  int dx[8] = {-2,-2,-1,-1,1,1,2,2};
  int dy[8] = {-1,1,-2,2,-2,2,-1,1};
  queue<pair<int,int> > que;
  que.push(make_pair(0,0));
  queue<int> count; count.push(0);
  while(!que.empty()){
    pair<int,int> cur = que.front(); que.pop();
    int now_count = count.front(); count.pop();
    if(cur == make_pair(X,Y) && now_count <= 3){
      cout << "YES" << endl;
      return 0;
    }
    if(now_count <= 3){
      for(int i=0;i<8;i++){
        pair<int,int> next = make_pair(cur.first + dx[i],cur.second + dy[i]);
        que.push(next);
        count.push(now_count + 1);
      }
    }else{
      cout << "NO" << endl;
      return 0;
    }
  }
  cout << "NO" << endl;
  return 0;
}