#include <iostream>
#include <algorithm>
using namespace std;

class range {private: struct I{int x;int operator*(){return x;}bool operator!=(I& lhs){return x<lhs.x;}void operator++(){++x;}};I i,n;
public:range(int n):i({0}),n({n}){}range(int i,int n):i({i}),n({n}){}I& begin(){return i;}I& end(){return n;}};

vector<int> dx = {-2, -2, -1, -1,  1, 1,  2, 2},
            dy = {-1,  1, -2,  2, -2, 2, -1, 1};

bool nya(int x, int y, int times) {
  if(times < 0) { return false; }
  if(x == 0 && y == 0) { return true; }
  bool res = false;
  for(int i : range(dx.size())) {
    int nx = x + dx[i],
        ny = y + dy[i];
    res |= nya(nx, ny, times-1);
  }
  return res;
}

int main(void) {
  int x, y; scanf("%d%d", &x, &y);
  puts(nya(x, y, 3) ? "YES" : "NO");
  return 0;
}