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

#define rep(i, j, n) for(int i=j;i<n;++i)
#define all(i) i.begin(),i.end()
#define rall(i) i.rbegin(),i.rend()
#define INF 1e9
const int mod = 1e9 + 7;

typedef long long i64;
typedef pair<int, int> pi;

template <class T> using vt = vector<T>;
template <class T> using vvt = vector<vector<T>>;

i64 gcd(i64 n, i64 m) {return (m == 0? n : gcd(m, n % m));}
i64 lcm(i64 n, i64 m) {return (n / gcd(n, m) * m);}
int dx[] = {-2, -1, 2, 1};
int dy[] = {-1, 1, -2, 2};

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

  int x, y;
  cin >> x >> y;
  if(abs(x) > 6 || abs(y) > 6) return cout << "NO\n", 0;

  vvt<int> dist(13, vt<int>(13, INF));
  x += 6; y += 6;
  dist[6][6] = 0;
  queue<pi> que;
  que.push({6, 6});

  while(!que.empty()) {
    int px = que.front().first, py = que.front().second;
    que.pop();

    int j = 0;
    rep(i, 0, 4) {
      for(int k = 0; k < 2; k++, j++, j %= 4) {
        int nx = px + dx[i], ny = py + dy[j];
        if(nx < 0 || nx > 12 || ny < 0 || ny > 12) continue;

        if(dist[px][py] + 1 >= dist[nx][ny]) continue;
        dist[nx][ny] = dist[px][py] + 1;
        que.push({nx, ny});
      }
    }
  }

  if(dist[x][y] <= 3) cout << "YES\n";
  else cout << "NO\n";
}