#include <iostream>
#include <vector>
#include <cstdio>
#include <sstream>
#include <map>
#include <string>
#include <algorithm>
#include <queue>
#include <cmath>
#include <set>
using namespace std;

long long dx[] = {-2,-2,-1,-1,1,1,2,2};
long long dy[] = {-1,1,-2,2,-2,2,-1,1};

int main(){
	long long X,Y;
	cin >> X >> Y;

	bool ok = false;

	queue<pair<long long, long long>> pos;
	queue<int> dist;
	pos.push({0,0});
	dist.push(0);
	while(pos.size()){
		long long x = pos.front().first;
		long long y = pos.front().second;
		pos.pop();

		int d = dist.front();
		dist.pop();

		if(x == X && y == Y) ok = true;

		if(d+1 > 3) continue;
		for(int i=0; i<8; i++){
			long long x_ = x + dx[i];
			long long y_ = y + dy[i];
			pos.push({x_,y_});
			dist.push(d+1);
		}
	}

	cout << (ok?"YES":"NO") << endl;

	return 0;
}