def dfs(hx,hy,hs):
	if hx == gx and hy == gy:
		return True
	ret = False
	for dx,dy in dxy:
		nx = hx + dx; ny = hy + dy
		if hs-1 > visit[ny][nx]:
			visit[ny][nx] = hs - 1
			ret |= dfs(nx, ny, hs-1)
	return ret
dxy = ((-2,-1),(-2,1),(-1,-2),(-1,2),(1,-2),(1,2),(2,-1),(2,1))
gx, gy = tuple(map(int,raw_input().split(" ")))
gx += 10; gy += 10
visit = [[-1 for i in range(21)] for j in range(21)] 
visit[10][10] = 3
print "YES" if dfs(10,10,3) else "NO"