MIN = -1000000000
MAX = 1000000000
def dfs(nox,noy,count):
	global x,y,MIN,MAX
	dx = [-2,-2,-1,-1,1,1,2,2]
	dy = [-1,1,-2,2,-2,2,-1,1]
	if count == 4:return False
	if nox == x and noy == y:
		return True
	ret = False
	for i in range(len(dx)):
		nx,ny = dx[i] + nox,dy[i] + noy
		if nx < MIN or nx > MAX or ny < MIN or ny > MAX:continue
		ret = ret or dfs(nx,ny,count + 1)
	return ret
x,y = map(long,raw_input().split())
if dfs(0,0,0):
	print 'YES'
else:
	print 'NO'