from collections import deque

def bfs():
    if X == 0 and Y == 0:
        return True
        
    queue = deque([])
    queue.append((0, 0, 0))
    
    while len(queue) > 0:
        current_x, current_y, current_depth= queue.popleft()
        
        if current_depth == 3:
            continue
        
        for move_x, move_y in [(-2, -1), (-2, 1), (-1, -2), (-1, 2), (1, -2), (1, 2), (2, -1), (2, 1)]:
            next_x, next_y = current_x + move_x, current_y + move_y
            
            if X == next_x and Y == next_y:
                return True
            
            queue.append((next_x, next_y, current_depth + 1))
            
    return False

X, Y = map(int, input().split())

if bfs():
    print('YES')
else:
    print('NO')