#include <bits/stdc++.h>
using namespace std;

using ll = long long;
#define rep(i, n) for(int i = 0; i < n; i++)

int main() {
	ll x, y;
	cin >> x >> y;
	vector<int> dy{-1, 1, -2, 2, -2, 2, -1, 1}, dx{-2, -2, -1, -1, 1, 1, 2, 2};
	using P = pair<int, int>;
	using PP = pair<P, int>;
	queue<PP> q;
	q.push(PP(P(0, 0), 0));
	set<P> st;
	st.insert(P(0, 0));
	while(q.size()) {
		int i, j, d;
		P p;
		tie(p, d) = q.front();
		q.pop();
		tie(i, j) = p;
		if(i == x && j == y) {
			cout << "YES" << endl;
			return 0;
		}
		if(d == 3) continue;
		rep(k, 8) {
			int nx = i + dx[k];
			int ny = j + dy[k];
			if(st.count(P(nx, ny))) continue;
			st.insert(P(nx, ny));
			q.push(PP(P(nx, ny), d + 1));
		}
	}
	cout << "NO" << endl;
}