import java.util.*;
public class walkChess{

	static int x;
	static int y;
	static final int[] canMove_x = {-2,-2,-1,-1,1,1,2,2};
	static final int[] canMove_y = {-1,1,-2,2,-2,2,-1,1};


	public static void main(String... args){
		int base_x = 0,base_y = 0;
		Scanner s = new Scanner(System.in);
		x = s.nextInt();
		y = s.nextInt();
		if(judge(0,0,0)){
			System.out.println("YES");
		}else{
			System.out.println("NO");
		}
	}

	public static boolean judge(int px,int py,int cw){
		int count = cw;
		if(px == x && py == y){
			return true;
		}else if(cw == 3){
			return false;
		}else{
			for(int i = 0; i < 8; i++){
				int after_x = px+canMove_x[i];
				int after_y = py+canMove_y[i];
				if(judge(after_x,after_y,count+1)){
					return true;
				}
			}
			return false;
		}

	}
}