import sys
from collections import deque

# Generate all reachable positions up to 3 steps
directions = [
    (2, 1), (2, -1), (-2, 1), (-2, -1),
    (1, 2), (1, -2), (-1, 2), (-1, -2)
]

reachable = set()
visited = set()

queue = deque()
queue.append((0, 0, 0))
visited.add((0, 0))
reachable.add((0, 0))

while queue:
    x, y, steps = queue.popleft()
    if steps < 3:
        for dx, dy in directions:
            nx = x + dx
            ny = y + dy
            if (nx, ny) not in visited:
                visited.add((nx, ny))
                queue.append((nx, ny, steps + 1))
                reachable.add((nx, ny))

# Read input
X, Y = map(int, sys.stdin.readline().split())

if X == 0 and Y == 0:
    print("YES")
else:
    manhattan = abs(X) + abs(Y)
    if manhattan > 9:
        print("NO")
    else:
        if (X, Y) in reachable:
            print("YES")
        else:
            print("NO")