#include <iostream>
#include <cmath>
#include <climits>
#include <string>
#include <vector>
#include <queue>
#include <stack>
#include <functional>
#include <algorithm>
#include <sstream>
#include <map>
#include <set>
#include <utility>

#define endl '\n'
#define ALL(a)  (a).begin(),(a).end()
#define SZ(a) int((a).size())
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define RFOR(i,a,b) for (int i=(b)-1;i>=(a);i--)
#define REP(i,n)  FOR(i,0,n)
#define RREP(i,n) for (int i=(n)-1;i>=0;i--)
#define DEBUG(x) cout<<#x<<": "<<x<<endl

using namespace std;

typedef pair<int,int> P;
typedef long long int LL;

const int vx[]={-2,-2,-1,-1,+1,1,+2,2};
const int vy[]={-1,+1,-2,+2,-2,2,-1,1};
vector<P> li;

void dfs(int i,int x,int y);

int main()
{
	ios::sync_with_stdio(false);
	cin.tie(0);
	dfs(3,0,0);
	int x,y;
	cin>>x>>y;
	string ans="NO";
	REP(i,SZ(li)){
		if(li[i]==P(x,y))	ans="YES";
	}
	cout<<ans<<endl;
	return 0;
}

void dfs(int i,int x,int y)
{
	if(i==0){
		li.push_back(P(x,y));
		return;
	}else{
		li.push_back(P(x,y));
		REP(j,8){
			dfs(i-1,x+vx[j],y+vy[j]);
		}
		return;
	}
}