//#include <atcoder/all>
#include <iostream>
#include <numeric>
#include <cmath>
#include <limits>
#include <stdio.h>
#include <iomanip>
#include <string> // string, to_string, stoi
#include <vector> // vector
#include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <utility> // pair, make_pair
#include <tuple> // tuple, make_tuple
#include <cstdint> // int64_t, int*_t
#include <cstdio> // printf
#include <map> // map
#include <queue> // queue, priority_queue
#include <set> // set
#include <stack> // stack
#include <deque> // deque
#include <unordered_map> // unordered_map
#include <unordered_set> // unordered_set
#include <bitset> // bitset
#include <cctype> // isupper, islower, isdigit, toupper, tolower
using namespace std;
//using namespace atcoder;
using ll = long long;
#define all(A) A.begin(),A.end()
using vll = vector<ll>;
#define rep(i, n) for (long long i = 0; i < (long long)(n); i++)
using Graph = vector<vector<ll>>;

int main() {
	vll dx = { -2,-2,-1,-1,1,1,2,2 };
	vll dy = { -1,1,-2,2,-2,2,-1,1 };
	ll X, Y;
	cin >> X >> Y;
	bool C = false;
	rep(i, 8) {
		rep(j, 8) {
			rep(k, 8) {
				if (X == dx[i] + dx[j] + dx[k] && Y == dy[i] + dy[j] + dy[k])C = true;
				if (X == dx[i] + dx[j]  && Y == dy[i] + dy[j] )C = true;
				if (X == dx[i]&& Y == dy[i])C = true;
				if (X == 0 && Y == 0)C = true;
			}
		}
	}
	cout << (C ? "YES" : "NO") << endl;
}