#!/usr/bin/env python3
# -*- coding: utf-8 -*-


import collections


DELTAS = [(-2, -1), (-2, 1), (-1, -2), (-1, 2),
          (1, -2), (1, 2), (2, -1), (2, 1)]
INF = 2 ** 16 - 1
LIMIT = 3


def breadth_first_search(goal):
    start = (0, 0)
    dist = collections.defaultdict(lambda: INF)
    dist[start] = 0
    queue = collections.deque()
    queue.append(start)
    while queue:
        (x0, y0) = queue.popleft()
        if (x0, y0) == goal:
            break
        for dx, dy in DELTAS:
            (x, y) = (x0 + dx, y0 + dy)
            if dist[(x, y)] == INF:
                dist[(x, y)] = dist[(x0, y0)] + 1
                queue.append((x, y))
    return dist[goal]


def judge(goal):
    if goal == (0, 0):
        return True
    elif sum(map(abs, goal)) > 10:
        return False
    else:
        return breadth_first_search(goal) <= LIMIT


def main():
    if judge(tuple(map(int, input().split()))):
        print("YES")
    else:
        print("NO")


if __name__ == '__main__':
    main()