import copy


def bfs(x, y):
    queue = [[0, 0]]
    cnt = 0
    while queue:
        stack = copy.deepcopy(queue)
        queue.clear()
        if cnt > 3:
            return False
        cnt += 1
        while stack:
            tmp = stack.pop(0)
            if tmp[0] == x and tmp[1] == y:
                return True
            queue = [
                [tmp[0] - 2, tmp[1] - 1],
                [tmp[0] - 2, tmp[1] + 1],
                [tmp[0] - 1, tmp[1] - 2],
                [tmp[0] - 1, tmp[1] + 2],
                [tmp[0] + 1, tmp[1] - 2],
                [tmp[0] + 1, tmp[1] + 2],
                [tmp[0] + 2, tmp[1] - 1],
                [tmp[0] + 2, tmp[1] + 1]
            ] + queue
    return False


if __name__ == '__main__':
    X, Y = [int(i) for i in input().split()]
    if bfs(X, Y):
        print('YES')
    else:
        print('NO')