#include<iostream> #include<cstdio> #include<cstring> #include <cstdlib> #include <cmath> #include<cctype> #include<string> #include<set> #include<iomanip> #include <map> #include<algorithm> #include <functional> #include<vector> #include<climits> #include<stack> #include<queue> #include <deque> #include <climits> #include <typeinfo> #include <utility> #define all(x) (x).begin(),(x).end() #define rep(i,m,n) for(int i = m;i < n;++i) #define pb push_back #define fore(i,a) for(auto &i:a) #define rrep(i,m,n) for(int i = m;i >= n;--i) #define INF INT_MAX/2 using namespace std; using ll = long long; using R = double; using Data = pair<ll, vector<int>>; const ll MOD = 1e9 + 7; const ll inf = 1LL << 50; struct edge { ll from; ll to; ll cost; }; set<pair<int, int>>able; void dfs(int x,int y,int n){ if (n == 4)return; able.insert({x,y}); int dx[4] = {-2,2,-1,1}; int dy[4] = {-2,2,-1,1}; rep(i, 0, 4) { if (abs(dx[i]) == 2) { rep(j, 2, 4)dfs(x + dx[i], y + dy[j], n + 1); } else { rep(j, 0, 3)dfs(x + dx[i], y + dy[j], n + 1); } } } int main() { int x, y; cin >> x >> y; dfs(0, 0, 0); if (able.count({x,y})!=0)cout << "YES" << endl; else cout << "NO" << endl; return 0; }