GOAL = tuple(map(int, input().split()))

move = [(-2, -1),(-2, 1),(-1, -2),(-1, 2),(1, -2),(1, 2),(2, -1),(2, 1)]

class Knight:
    def __init__(self, state, count):
        self.state = state
        self.count = count

def dfs(goal):
    visited = []
    stack = [Knight((0, 0), 0)]
    while stack:
        a = stack.pop(0)
        if a.count > 3:
            continue
        if a.state == goal:
            return 'YES'
        x, y = a.state
        n = a.count + 1
        for j, k in move:
            v = (x+j, y+k)
            if v in visited:
                continue
            c = Knight(v, n)
            stack.append(c)
            visited.append(v)
    return 'NO'
        
if __name__ == '__main__':
    print(dfs(GOAL))