#include<iostream>
#include<vector>
#include<queue>

using namespace std;

typedef pair<int,int> P;
typedef long long ll;

static const ll MAX_L=1000000000;
static const ll MAX=110;

ll d[MAX][MAX];

void bfs(){
    for(int i=0;i<=100;i++){
        for(int j=0;j<=100;j++){
            d[i][j]=-1;
        }
    }
    queue<P> que;
    que.push(P(0,0));
    d[0][0]=0;
    int cnt=0;
    while(!que.empty()){
        if(cnt==8) break;
        P p=que.front(); que.pop();
        ll dx[2],dy[2];
        dx[0]=p.first+1; dy[0]=p.second+2;
        dx[1]=p.first+2; dy[1]=p.second+1;
        for(int i=0;i<2;i++){
            if(d[dx[i]][dy[i]]==-1){
                que.push(P(dx[i],dy[i]));
                d[dx[i]][dy[i]]=d[p.first][p.second]+1;
            }
        }
        cnt++;
    }
}

int main(){
    int X,Y;
    cin >> X >> Y;
    if(X<0) X*=-1;
    if(Y<0) Y*=-1;
    bfs();
    if(d[X][Y]==-1){
        cout << "NO" << endl;
    }else{
        cout << "YES" << endl;
    }
}