#include<bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i,m,n) for(int i=m; i<int(n); ++i)
#define repll(i,m,n) for(ll i=m; i<ll(n); ++i)
#define all(a) (a).begin(), (a).end()
#define rall(a) (a).rbegin(), (a).rend()
#define fi first
#define se second

template<typename T> bool chmin(T& a, T b){ if(a > b){a = b; return true;} return false; }
template<typename T> bool chmax(T& a, T b){ if(a < b){a = b; return true;} return false; }

template<typename T> T gcd(T a, T b){ return a % b ? gcd(b, a % b) : b; }
template<typename T> T lcm(T a, T b){ return a / gcd(a, b) * b; }

const vector<pair<int, int>> direct = {{-2, -1}, {-2, 1}, {-1, -2}, {-1, 2}, 
                                       {1, -2}, {1, 2}, {2, -1}, {2, 1}};
int gx, gy;

void rec(int step, int x, int y){
    if(x == gx && y == gy){
        cout << "YES" << endl;
        exit(0);
    }
    if(step == 3) return;

    for(auto [dx, dy] : direct){
        rec(step + 1, x + dx, y + dy);
    }
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    cin >> gx >> gy;
    rec(0, 0, 0);

    cout << "NO" << endl;
    return 0;
}