gx,gy = map(int,input().split())

def walk_knight(lst):
    tmp = set()
    for xy in lst:
        x,y = xy[0],xy[1]
        if x==gx and y==gy:
            print("YES")
            exit(0)
        for i in [[1,2],[1,-2],[2,1],[2,-1],[-1,2],[-1,-2],[-2,1],[-2,-1]]:
            tmp.add((x+i[0],y+i[1]))
    return tmp

if max(abs(gx),abs(gy))<=6:
    lst = [[0,0]]
    for i in range(4):
        lst = walk_knight(lst)
print("NO")