#include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <cctype>
#include <cmath>
#include <iostream>
#include <queue>
#include <list>
#include <map>
#include <numeric>
#include <set>
#include <sstream>
#include <string>
#include <vector>
using namespace std;
#define REP(i,a,n) for(int i=(a); i<(int)(n); i++)
#define rep(i,n) REP(i,0,n)
#define FOR(it,c) for(__typeof((c).begin()) it=(c).begin(); it!=(c).end(); ++it)
#define ALLOF(c) (c).begin(), (c).end()
typedef long long ll;

map<pair<int,int>,int> memo;

int vx[8] = {-2,-2,-1,-1,1,1,2,2};
int vy[8] = {-1,1,-2,2,-2,2,-1,1};

void solve(int x, int y, int step){
  if(step >= 4) return;
  memo[make_pair(x,y)] = 1;

  rep(i,8){
    int nx = x + vx[i];
    int ny = y + vy[i];
    solve(nx, ny, step+1);
  }
}

int main(){
  int X, Y;
  
  cin >> X >> Y;
  solve(0,0,0);
  if(memo.count(make_pair(X,Y)) > 0) cout << "YES" << endl;
  else cout << "NO" << endl;
  
  return 0;
}