#include <iostream>
#include <set>
#include <algorithm>
#include <utility>
#include <tuple>
#include <queue>
using namespace std;
#define REP(i,a,b) for(int i=a;i<(int)b;i++)
#define rep(i,n) REP(i,0,n)
int dx[] = {-2,-2,-1,+1,+2,+2,+1,-1};
int dy[] = {-1,+1,-2,-2,+1,-1,+2,+2};
int main() {
  int x, y; cin >> x >> y;
  set<tuple<int,int>> used;
  queue<tuple<int,int,int>> q;
  q.emplace(0,x,y);
  used.emplace(x,y);
  while(!q.empty()) {
    int c = std::get<0>(q.front());
    x=std::get<1>(q.front());
    y=std::get<2>(q.front());
    q.pop();
    if(x==0&&y==0) { cout << "YES\n"; return 0; }
    if(c == 3) { continue; }
    rep(i, 8){
      int nx=x+dx[i],ny=y+dy[i];
      if(used.count(std::tie(nx,ny))) { continue; }
      q.emplace(c+1,nx,ny);
      used.emplace(nx,ny);
    }
  }

  cout << "NO\n";

  return 0;
}