import java.io.PrintWriter;
import java.util.Arrays;
import java.util.Scanner;
 
// Solution
public class Main {
  private static Scanner in;
  private static PrintWriter out;
  private static final String INPUT = ""; // input file name
 
  /**
   * Interactive get next command
   */
  static int get(int pos) {
    out.println(pos + 1);
    out.flush();
    return ni();
  }
 
  static void solve() {
    int x = ni();
    int y = ni();
    
    int f = (y / 2) - x;
    int t = x - f ;
    
    if (y % 2 != 0 || f < 0 || t < 0) {
      out.println("No");
    } else {
    	out.println("Yes");
    }
  }
 
  public static void main(String[] args) throws Exception {
    long S = System.currentTimeMillis();
    in = INPUT.isEmpty() ? new Scanner(System.in) : new Scanner(INPUT);
    out = new PrintWriter(System.out);
 
    solve();
    out.flush();
    long G = System.currentTimeMillis();
    tr(G - S + "ms");
  }
 
  private static int ni() {
    return Integer.parseInt(in.next());
  }
 
  private static long nl() {
    return Long.parseLong(in.next());
  }
 
  // Math Utils
  private static int pi(int num, int pow) {
    int result = 1;
 
    while (pow > 0) {
      if (pow % 2 == 1) {
        result *= num;
      }
 
      num *= num;
      pow /= 2;
    }
 
    return result;
  }
 
  private static int pim(int num, int pow, int mod) {
    int result = 1;
 
    while (pow > 0) {
      if (pow % 2 == 1) {
        // keep collecting `odd` num in result
        result = (result * num) % mod;
      }
 
      num = (num * num) % mod;
      pow /= 2;
    }
 
    return result;
  }
 
  private static long pl(long num, long pow) {
    long result = 1;
 
    while (pow > 0) {
      if (pow % 2 == 1) {
        result *= num;
      }
 
      num *= num;
      pow /= 2;
    }
 
    return result;
  }
 
  private static long plm(long num, long pow, long mod) {
    long result = 1;
 
    while (pow > 0) {
      if (pow % 2 == 1) {
        // keep collecting `odd` num in result
        result = (result * num) % mod;
      }
 
      num = (num * num) % mod;
      pow /= 2;
    }
 
    return result;
  }
 
  static void tr(Object... o) {
    if (!INPUT.isEmpty())
      out.println(Arrays.deepToString(o));
  }
}
/tmp/hf-datasets-cache/medium/datasets/42704881117311-config-parquet-and-info-qiankunmu-Project_CodeNet-896c9d36/hub/datasets--qiankunmu--Project_CodeNet_Python800_and_Java250/snapshots/c899fde44a77ba1cc14973ed3de064e4ff3aadc7/Project_CodeNet_Java250.tar.gz