import sys

sys.setrecursionlimit(10 ** 6)
from bisect import *
from collections import *
from heapq import *

int1 = lambda x: int(x) - 1
p2D = lambda x: print(*x, sep="\n")
def II(): return int(sys.stdin.readline())
def SI(): return sys.stdin.readline()[:-1]
def MI(): return map(int, sys.stdin.readline().split())
def MI1(): return map(int1, sys.stdin.readline().split())
def MF(): return map(float, sys.stdin.readline().split())
def LI(): return list(map(int, sys.stdin.readline().split()))
def LI1(): return list(map(int1, sys.stdin.readline().split()))
def LF(): return list(map(float, sys.stdin.readline().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]
dij = [(0, 1), (1, 0), (0, -1), (-1, 0)]

def main():
    s = set([(0, 0)])
    for _ in range(3):
        n = set()
        for x, y in s:
            for dx in range(1,3):
                dy = 3 - dx
                n.add((x - dx, y - dy))
                n.add((x + dx, y + dy))
                n.add((x - dx, y + dy))
                n.add((x + dx, y - dy))
        s |= n
    x, y = MI()
    if (x,y) in s: print("YES")
    else: print("NO")

main()