#include<iostream>
#include<cstdio>
#include<vector>
#include<set>
#include<queue>
#include<map>
#include<string>
#include<algorithm>
#include<functional>
using namespace std;
#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 (int i=0;i<(n);i++)
#define RREP(i,n) for (int i=(n)-1;i>=0;i--)
#define INF 1<<30
#define MP make_pair
#define mp make_pair
#define pb push_back
#define PB push_back
#define DEBUG(x) cout<<#x<<": "<<x<<endl
#define ll long long
#define ull unsigned long long
#define P pair<int,int>
set<P> mem;
void dfs(P a, int dep){
	int dx[] ={-2,-2,-1,-1,1,1,2,2};
	int dy[]={-1,1,-2,2,-2,2,-1,1};
	if(dep==3) return;
	REP(i,8){
		P na=mp(a.first+dx[i],a.second+dy[i]);
		mem.insert(na);
		dfs(na,dep+1);
	}
}
int main(){
	int x,y;cin>>x>>y;
	mem.insert(mp(0,0));
	dfs(mp(0,0),0);
	if(mem.count(mp(x,y))) {cout<<"YES"<<endl;return 0;};
	cout<<"NO"<<endl;
	return 0;
}