#include <set>
#include <map>
#include <list>
#include <queue>
#include <stack>
#include <cmath>
#include <ctype.h>
#include <ctime>
#include <cstdio>
#include <vector>
#include <string>
#include <bitset>
#include <cctype>
#include <cstdlib>
#include <cstring>
#include <utility>
#include <numeric>
#include <complex>
#include <sstream>
#include <fstream>
#include <iomanip>
#include <cassert>
#include <iostream>
#include <iterator>
#include <algorithm>
#define aLL(g) (g).begin(),(g).end()
#define REP(i, x, n) for(int i = x; i < n; i++)
#define rep(i,n) REP(i,0,n)
#define F(i,j,k) fill(i[0],i[0]+j*j,k)
#define P(p) cout<<(p)<<endl;
#define EXISt(s,e) ((s).find(e)!=(s).end())
#define INF 1<<25
#define MAX 100000000
#define pb push_back
using namespace std; 
typedef vector<int> vi;
typedef vector<long long> vl;
typedef vector<double> vd;
typedef pair<int,int> pii;
typedef pair<long,long> pll;
typedef long long ll;
int dx[] = {0,1,0,-1};
int dy[] = {-1,0,1,0};

int sttoi(std::string str){int ret;std::stringstream ss;ss << str;ss >> ret;return ret;}

int table[10001];

int x[] = {-2,-2,-1,-1,1,1,2,2};
int y[] = {-1,1,-2,2,2,-2,1,-1};
bool f[7][7];

int main(){
  int a,b;
  cin >> a >> b;
  if(a == 0 && b == 0){
    P("YES");
    return 0;
  }
  int i = 0,j = 0;
  rep(i,8){
    rep(j,8){
      rep(k,8){
        f[x[i]+x[j]+x[k]][y[i]+y[j]+y[k]] = true;
      }
    }
  }
  if(f[a][b]){
    P("YES");
  }else{
    P("NO");
  }
}