import java.util.Arrays;
import java.util.HashSet;
import java.util.LinkedList;
import java.util.Scanner;
import java.util.Set;

public class Main {
	
	public static final int[] vs = {1, 2, 2, 1, -1, -2, -2, -1};
	
	public static boolean dfs(final int X, final int Y, int rest, int k_x, int k_y){
		if(X == k_x && Y == k_y){
			return true;
		}else if(rest <= 0){
			return false;
		}
		
		for(int index = 0; index < vs.length; index++){
			final int dx = vs[index];
			final int dy = vs[(index + vs.length / 4) % vs.length];
			
			if(dfs(X, Y, rest - 1, k_x + dx, k_y + dy)){
				return true;
			}
		}
		
		return false;
	}
	
	public static void main(String[] args){
		Scanner sc = new Scanner(System.in);
		
		final int X = sc.nextInt();
		final int Y = sc.nextInt();
		
		System.out.println(dfs(X, Y, 3, 0, 0) ? "YES" : "NO");
		
		
	}
	
}