Problem:
 Score : 200 points    Problem Statement There are some animals in a garden. Each of them is a crane with two legs or a turtle with four legs.  Takahashi says: "there are X animals in total in the garden, and they have Y legs in total." Determine whether there is a combination of numbers of cranes and turtles in which this statement is correct.      Constraints  1 \leq X \leq 100  1 \leq Y \leq 100  All values in input are integers.         Input Input is given from Standard Input in the following format:  X  Y       Output If there is a combination of numbers of cranes and turtles in which the statement is correct, print Yes ; otherwise, print No .        Sample Input 1 3 8      Sample Output 1 Yes  The statement "there are 3 animals in total in the garden, and they have 8 legs in total" is correct if there are two cranes and one turtle. Thus, there is a combination of numbers of cranes and turtles in which the statement is correct.       Sample Input 2 2 100      Sample Output 2 No  There is no combination of numbers of cranes and turtles in which this statement is correct.       Sample Input 3 1 2      Sample Output 3 Yes  We also consider the case in which there are only cranes or only turtles.

Solution (Python):
x, y = map(int, input().split())
if y % 2 == 1:
    print("No")
    quit()

if x * 2 <= y <= x * 4:
    print("Yes")
else:
    print("No")

Solution (Python):
import sys
x, y = map(int,input().split())
for i in range(51):
    for j in range(26):
        if i * 2 + j * 4 == y and i + j == x:
            print("Yes")
            sys.exit()
print("No")

Solution (Python):
X,Y = map(int,input().split())
res = 'No'
for x in range(0,X+1):
    a = x
    b = X-x
    if 2*a + 4*b == Y:
        res = 'Yes'
print(res)

Solution (Python):
x, y = map(int, input().split())

if y % 2 == 0:
    tsuru = 2*x - y//2
    kame = y//2-x
    if tsuru >= 0 and kame >= 0:
        print('Yes')
    else:
        print('No')
else:
    print('No')

Solution (Python):
x, y = map(int, input().split())

is_exit = False

for t in range(0, 101):
    for k in range(0, 101):
        if t + k == x and 2*t + 4*k == y:
            is_exit = True
            break

if is_exit:
    print("Yes")
else:
    print("No")

Solution (Python):
x,y = map(int,input().split())
flg = True
for i in range(0,x+1):
    if 2*i+4*(x-i) == y:
        print("Yes")
        flg = False
        break
if flg:
    print("No")

Solution (Python):
import sys 
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
X, Y = map(int, readline().split())
x = 2*X
if x > Y:
  print('No')
  sys.exit()
for i in range(X+1):
  if (x + 2*i) == Y:
    print('Yes')
    sys.exit()
print('No')

Solution (Python):
import sys

X, Y = [int(n) for n in input().split()]

for a in range(101):
    for b in range(101):
        if a + b == X and 2*a + 4*b == Y:
            print('Yes')
            sys.exit(0)

print('No')

Solution (Python):


X, Y = map(int, input().split())





ans = "Yes"

if not Y%2 == 0:
    ans = "No"
elif Y < 2*X:
    ans = "No"
elif 4*X < Y:
    ans = "No"

print(ans)

Solution (Python):
x,y= map(int, input().split())
s=(y-2*x)
t=(4*x-y)
if s%2==0 and t%2==0 and s>=0 and t>=0:
    print('Yes')
else:
    print('No')

Solution (Python):
X,Y = map(int,input().split())

flag = False

for i in range(X+1):
    if Y == (2*i + 4*(X-i)):
        flag = True

if flag:
    print('Yes')
else:
    print('No')

Solution (Python):
x,y=map(int,input().split())
if y%2==0 and 2*x<=y and y<=4*x:
  print('Yes')
else:
  print('No')

Solution (Python):
X, Y = map(int, input().split())
flag = False
for i in range(0, X+1):
    nokori = Y - i*2
    if (X-i) * 4 == nokori:
        flag = True
        break
print('Yes' if flag else 'No')

Solution (Python):
X, Y = map(int, input().split())
ans = "No"
for i in range(0, X + 1):
    if 2*i + 4*(X - i) == Y:
        ans = "Yes"
print(ans)

Solution (Python):
from sys import stdin

A = list(map(int,stdin.readline().split()))

if A[1]-2*A[0]<0:
    print('No')
else:
    if (A[1]-2*A[0])%2==0:
        if (A[1]-2*A[0])/2>A[0]:
            print('No')
        else:
            print('Yes')
    else:
        print('No')

Solution (Python):
x,y = map(int,input().split())
if y%2==0 and x*2<=y and x*4>=y:
  print("Yes")
else:
  print("No")

Solution (Python):
import sys
X, Y = map(int,input().split())

for a in range(X+1):
    if Y == 2*(X-a) + 4 * a:
        print('Yes')
        sys.exit()
print('No')

Solution (Python):
import sys
read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines

def main():
    x,y = map(int, readline().split())

    a = 4 * x - y
    b = y - 2 * x

    if a % 2 == 0 and b % 2 == 0:
        if a >= 0 and b >= 0:
            print("Yes")
        else:
            print("No")
    else:
        print("No")


if __name__ == "__main__":
    main()

Solution (Python):
x, y = map(int, input().split())
if y%2==0 and 2*x <= y <= 4*x:
  print('Yes')
else:
  print('No')

Solution (Python):
from sys import stdin, stdout

int_in = lambda: int(stdin.readline())
arr_in = lambda: [int(x) for x in stdin.readline().split()]
mat_in = lambda rows: [arr_in() for y in range(rows)]
str_in = lambda: stdin.readline().strip()
out = lambda o: stdout.write("{}\n".format(o))
arr_out = lambda o: out(" ".join(map(str, o)))
bool_out = lambda o: out("YES" if o else "NO")
tests = lambda: range(1, int_in() + 1)
case_out = lambda i, o: out("Case 


def solve(x, y):
    min_legs = 2 * x
    max_legs = 4 * x
    return (min_legs <= y <= max_legs) and y % 2 == 0



if __name__ == "__main__":
    x, y = arr_in()
    out("Yes" if solve(x, y) else "No")

Solution (Python):
x, y = map(int,input().split())
if (y - 2*x) % 2 == 0 and (y-2*x) //2 <= x and (y-2*x) //2 >= 0:
    print('Yes')
else:
    print('No')

Solution (Python):
a,b = [int(j) for j in input().split()]
if (b-2*a)%2==0 and (b-2*a)>=0:
    if (b-2*a)//2<=a:
        print("Yes")
    else:
        print("No")
else:
    print("No")

Solution (Python):
from collections import deque
from heapq import heapify,heappop,heappush,heappushpop
from copy import copy,deepcopy
from itertools import product,permutations,combinations,combinations_with_replacement
from collections import defaultdict,Counter
from bisect import bisect_left,bisect_right


from functools import reduce
from pprint import pprint


INF = float("inf")

def mycol(data,col):
    return [ row[col] for row in data ]

def mysort(data,col,reverse_flag):
    data.sort(key=lambda x:x[col],reverse=reverse_flag)
    return data

def mymax(data):
    M = -1*float("inf")
    for i in range(len(data)):
        m = max(data[i])
        M = max(M,m)
    return M

def mymin(data):
    m = float("inf")
    for i in range(len(data)):
        M = min(data[i])
        m = min(m,M)
    return m

def mycount(ls,x):
    
    l = bisect_left(ls,x)
    r = bisect_right(ls,x)
    return (r-l)

def myoutput(ls,space=True):
    if space:
        if len(ls)==0:
            print(" ")
        elif type(ls[0])==str:
            print(" ".join(ls))
        elif type(ls[0])==int:
            print(" ".join(map(str,ls)))
        else:
            print("Output Error")
    else:
        if len(ls)==0:
            print("")
        elif type(ls[0])==str:
            print("".join(ls))
        elif type(ls[0])==int:
            print("".join(map(str,ls)))
        else:
            print("Output Error")

def I():
    return int(input())

def MI():
    return map(int,input().split())

def RI():
    return list(map(int,input().split()))

def CI(n):
    return [ int(input()) for _ in range(n) ]

def LI(n):
    return [ list(map(int,input().split())) for _ in range(n) ]

def S():
    return input()

def MS():
    return input().split()

def RS():
    return list(input().split())

def CS(n):
    return [ input() for _ in range(n) ]

def LS(n):
    return [ list(input().split()) for _ in range(n) ]

x,y = MI()

if y%2==1:
    print("No")
else:
    a = 2*x - y//2
    b = y//2 - x
    if a>=0 and b>=0:
        print("Yes")
    else:
        print("No")

Solution (Python):
head, foot = map(int,input().split())
ans = 'No'
for i in range(head+1):
  if i*2 + (head-i)*4 == foot:
    ans = 'Yes'
print(ans)

Solution (Python):




import sys
from io import StringIO
import unittest

def yn(b):
    print("Yes" if b==1 else "No")
    return

def resolve():
    readline=sys.stdin.readline

    x,y=map(int, readline().rstrip().split())

    for a in range(101):
        for b in range(101):
            if ((a+b)==x) and ((a*2 + b*4)==y):
                print("Yes")
                return
    print("No")
    
    
    
    

    return

if 'doTest' not in globals():
    resolve()
    sys.exit()

Solution (Python):
import itertools
X, Y = list(map(int, input().split(' ')))
for i in itertools.combinations_with_replacement([2,4],X):
    if sum(i)==Y:
        print('Yes')
        break
else:
    print('No')

Solution (Python):
x,y=map(int,input().split())
if y%2==0 and 2*x<=y and y<=4*x:
  print('Yes')
else:
  print('No')

Solution (Python):
import sys

X, Y = map(int, input().split())

for i in range(X+1):
    p = i*2 + (X-i)*4
    if p == Y:
        print('Yes')
        sys.exit()

print('No')

Solution (Python):
x,y= map(int, input().split())
for i in range(0,101):
    for j in range(0,101):
        if i + j == x and (i*2)+(j*4) == y:
            print("Yes")
            exit(0)
print("No")

Solution (Python):
x, y = map(int, input().split())

flug = False
for i in range(x+1):
  res = 2*i + 4*(x-i)
  if res == y:
    flug = True
    break

if flug == True:
  print("Yes")
else:
  print("No")

Solution (Python):
X, Y = map(int, input().split())

y_min, y_max = 2 * X, 4*X

ans = "No"

if (y_min <= Y <= y_max) and (Y%2 == 0):
    ans = "Yes"

print(ans)

Solution (Python):
x,y=[int(i) for i in input().split()]
for i in range(x + 1):
    if i * 2 + (x - i) * 4 == y:
        print("Yes")
        break
else:
    print("No")

Solution (Python):
import sys
sys.setrecursionlimit(10**7) 
import math
from copy import copy, deepcopy
from copy import deepcopy as dcp
from operator import itemgetter
from bisect import bisect_left, bisect, bisect_right

from collections import deque


from collections import Counter

from itertools import accumulate

from heapq import heapify,heappop,heappush


from functools import lru_cache


def input(): return sys.stdin.readline()[:-1]
def printl(li): _=print(*li, sep="\n") if li else None
def argsort(s, return_sorted=False): 
    inds=sorted(range(len(s)), key=lambda k: s[k])
    if return_sorted: return inds, [s[i] for i in inds]
    return inds
def alp2num(c,cap=False): return ord(c)-97 if not cap else ord(c)-65
def num2alp(i,cap=False): return chr(i+97) if not cap else chr(i+65)
def matmat(A,B):
    K,N,M=len(B),len(A),len(B[0])
    return [[sum([(A[i][k]*B[k][j]) for k in range(K)]) for j in range(M)] for i in range(N)]
def matvec(M,v):
    N,size=len(v),len(M)
    return [sum([M[i][j]*v[j] for j in range(N)]) for i in range(size)]
def T(M):
    n,m=len(M),len(M[0])
    return [[M[j][i] for j in range(n)] for i in range(m)]
def main():
    mod = 1000000007
    

    
    X,Y = map(int, input().split())
    
    
    

    if (Y-2*X)//2>=0 and (Y-2*X)%2==0 and 2*X-Y//2>=0:
        print("Yes")
    else:
        print("No")




if __name__ == "__main__":
    main()

Solution (Python):
X, Y = map(int, input().split())

if Y > X*4 or Y < 2*X or Y % 2 != 0:
    print("No")
else:
    print("Yes")

Solution (Python):
x,y=map(int,input().split())

b=(y-2*x)/2
a=x-b

if a>=0 and b>=0 and a%1==0:
    print("Yes")

else:
    print("No")

Solution (Python):
import sys, io, os, re
import bisect
from pprint import pprint
from math import sin, cos, pi, radians, sqrt, floor
from copy import copy, deepcopy
from collections import deque
from fractions import gcd
from functools import reduce
from itertools import groupby

n1 = lambda: int(sys.stdin.readline().strip())
nn = lambda: list(map(int, sys.stdin.readline().strip().split()))
f1 = lambda: float(sys.stdin.readline().strip())
fn = lambda: list(map(float, sys.stdin.readline().strip().split()))
s1 = lambda: sys.stdin.readline().strip()
sn = lambda: list(sys.stdin.readline().strip().split())
nl = lambda n: [n1() for _ in range(n)]
fl = lambda n: [f1() for _ in range(n)]
sl = lambda n: [s1() for _ in range(n)]
nm = lambda n: [nn() for _ in range(n)]
fm = lambda n: [fn() for _ in range(n)]
sm = lambda n: [sn() for _ in range(n)]

def array1(n): return [0] * n
def array2(n, m): return [[0] * m for x in range(n)]
def array3(n, m, l): return [[[0] * l for y in xrange(m)] for x in xrange(n)]

X, Y = nn()

for i in range(X+1):
    if (i * 2 +  (X - i) * 4) == Y:
        print("Yes")
        exit(0)
else:
    print("No")

Solution (Python):
def main():
    X, Y = list(map(int, input().split(' ')))
    
    
    if Y % 2 == 0 and 2*X <= Y <= 4*X:
        print('Yes')
    else:
        print('No')



if __name__ == '__main__':
    main()

Solution (Python):
def main():
    x,y  = map(int,input().split())
    if y-2*x<0:
        print('No')
    else:
        if (y-2*x)%2==1:
            print('No')
        else:
            b = (y-2*x)//2
            if x-b>=0:
                print('Yes')
            else:
                print('No')
    
if __name__ == "__main__":
    main()

Solution (Python):
import sys
from collections import deque
from itertools import *

def I(): return int(sys.stdin.readline().rstrip())
def LI(): return list(map(int,sys.stdin.readline().rstrip().split()))
def S(): return sys.stdin.readline().rstrip()
def LS(): return list(sys.stdin.readline().rstrip().split())

X,Y = LI()

for i in range(X+1):
    for q in range(X-i+1):
        if i*2 + q*4 == Y and i+q == X:
            print('Yes')
            exit()
print('No')

Solution (Python):
X, Y = map(int, input().split())

if Y % 2 == 0 and Y/2 - X >= 0 and 2 * X - Y/2 >= 0:
  print('Yes')
else:
  print('No')

Solution (Python):
x,y = map(int, input().split())

if 2*x <= y and y <= 4*x:
    if y % 2 == 0:
        print('Yes')
    else:
        print('No')
else:
    print('No')

Solution (Python):
x,y = map(int,input().split())
y = y-2*x

if y < 0:
  print('No')
  exit()

if y%2 == 0 and y <= x*2:
  print('Yes')
else:
  print('No')

Solution (Python):

def resolve():
    x, y = map(int, input().split())
    OK = False
    for i in range(x+1):
        t = i
        k = x-i
        if i*2+k*4 == y:
            OK = True
    print ("Yes") if OK else print("No")

resolve()

Solution (Python):
x, y = [int(_) for _ in input().split(' ')]

if y % 2 == 0 and 2 * x - y // 2 >= 0 and y // 2 - x >= 0:
    print('Yes')
else:
    print('No')

Solution (Python):
X, Y = map(int, input().split())
print("Yes" if 2 * X <= Y <= 4 * X and (Y % 2 == 0) else "No")

Solution (Python):
x,y=map(int,input().split())
for i in range(100):
  for j in range(100):
    if (i+j)==x:
      if (2*i)+(4*j)==y:
        print("Yes")
        exit()
print("No")

Solution (Python):
import itertools
import decimal
import math
import collections
import sys
input = sys.stdin.readline

X,Y=map(int,input().split())




ans="No"
for i in range(0,X+1):
    if((i*2 + (X-i)*4)==Y):
        ans="Yes"
        break

print(ans)

Solution (Python):
import sys
import heapq, math
from itertools import zip_longest, permutations, combinations, combinations_with_replacement
from itertools import accumulate, dropwhile, takewhile, groupby
from functools import lru_cache
from copy import deepcopy
X, Y = map(int, input().split())

y = (Y - 2 * X) // 2
x = (4 * X - Y) // 2

if y < 0 or x < 0 or x + y != X or 2 * x + 4 * y != Y:
    print("No")
else:
    print("Yes")

Solution (Python):
a, b = map(int, input().split())

if 2*a <= b <= 4*a:
    if b%2 ==0:
        print("Yes")
    else:
        print("No")

else:
    print("No")

Solution (Python):
def main():
    x,y=map(int,input().split())
    for turu in range(x+1):
        kame = x - turu
        if turu*2 + kame*4 == y:
            print("Yes")
            return
    print("No")

if __name__ == '__main__':
    main()

Solution (Python):
import numpy as np
import scipy.sparse as sps
import scipy.misc as spm
import collections as col
import functools as func
import itertools as ite
import fractions as frac
import math as ma
import cmath as cma
import copy as cp
import sys
def sinput(): return sys.stdin.readline().strip()
def iinput(): return int(sinput())
def imap(): return map(int, sinput().split())
def fmap(): return map(float, sinput().split())
def iarr(n=0):
    if n: return [0 for _ in range(n)]
    else: return list(imap())
def farr(): return list(fmap())
def sarr(n=0):
    if n: return ["" for _ in range(n)]
    else: return sinput().split()
def adj(n): return [[] for _ in range(n)]
sys.setrecursionlimit(10**7)
MOD = 10**9 + 7; EPS = sys.float_info.epsilon
PI = np.pi; EXP = np.e; INF = np.inf

x,y = imap()
a = 2*x - y//2
b = -x + y//2

ans = "Yes"
if a<0 or b<0: ans = "No"
if y%2 != 0: ans = "No"

print(ans)

Solution (Python):
x,y=map(int,input().split())
if 2*x<=y and y%2==0 and 4*x>=y:
    print('Yes')
else:
    print('No')

Solution (Python):
X, Y = map(int, input().split())
for c in range(X+1):
  t = X - c
  if 2*c + 4*t == Y:
    print("Yes")
    exit()
else:
  print('No')

Solution (Python):
x, y = map(int, input().split())
if x * 2 <= y <= x * 4 and y % 2 == 0:
    print("Yes")
else:
    print("No")

Solution (Python):
import sys
input = sys.stdin.readline




'''
a=[]
b=[]
for i in range():
    A, B = map(int, input().split())
    a.append(A)
    b.append(B)'''

x,y = map(int, input().split())

for i in range(x+1):
    if 2*(x-i)+4*i==y:
        print("Yes")
        sys.exit()
print("No")

Solution (Python):
X,Y = map(int,input().split())

for i in range(X+1):
    if 2*i + 4*(X-i) == Y:
        print("Yes")
        exit()

print("No")

Solution (Python):
X, Y = [int(s) for s in input().strip().split()]

is_found = False

for t in range(101):
    for k in range(101):
        if t + k == X and 2*t + 4*k == Y:
            is_found = True
            break

    if is_found:
        break

if is_found:
    print("Yes")
else:
    print("No")

Solution (Python):
import sys
from collections import defaultdict, Counter, namedtuple, deque
import itertools
import functools
import bisect
import heapq
import math


MOD = 10 ** 9 + 7



x, y = map(int, input().split())
a = y-2*x
b = 4*x - y
if a >= 0 and a%2 == 0 and b >= 0 and b%2 == 0:
    print("Yes")
else:
    print("No")

Solution (Python):
X, Y = list(map(int, input().split()))
flg = 0
for i in range(100):
    for j in range(100):
        if i + j == X and 2 * i + 4 * j == Y:
            print("Yes")
            flg = 1
            break
if flg == 0:
    print("No")

Solution (Python):
x, y = [int(i) for i in input().split()]
ans = False
for i in range(x+1):
  if (x - i)*2 + i*4 == y:
    ans = True
    break
if ans:
  print("Yes")
else:
  print("No")

Solution (Python):
X, Y = list(map(int, input().split()))
if Y%2 == 1:
    print('No')
elif X*2 <= Y and X*4 >= Y:
    print('Yes')
else:
    print('No')

Solution (Python):

x,y = map(int,input().split())
flg = False
for i in range(101):
    if x - i >= 0:
        a = i
        b = x - a
        if a * 2 + 4 * b == y:
            flg = True
            break
        
if flg:
    print('Yes')
else:
    print('No')

Solution (Python):
X, Y=map(int, input().split())
ans = 'No'
for i in range(X+1):
  XX = X - i
  if XX * 2 + i * 4 == Y:
    ans = 'Yes'
    break
print(ans)

Solution (Python):
import sys
import math
from collections import deque
from collections import defaultdict
from copy import deepcopy
from itertools import accumulate 
def input(): return sys.stdin.readline().rstrip()
from functools import lru_cache 

def main():
    x, y = list(map(int,sys.stdin.readline().split()))
    if y % 2 == 1:
        print("No")
    else:
        if 2 * x <= y and y <= 4 * x:
            print("Yes")
        else: print("No")
    return 0

if __name__ == "__main__":
    main()

Solution (Python):
x, y = [int(e) for e in input().split()]

if y % 2 == 0 and x * 2 <= y and x * 4 >= y:
    print('Yes')
else:
    print('No')

Solution (Python):
X,Y = map(int,input().split())

for x in range(0,101):

    y = X-x
    if y<0:
        continue
    if x*2 + y*4 == Y:
        print("Yes")
        break
else:
    print("No")

Solution (Python):
x, y = map(int, input().split())

def answer():
    if y % 2 == 1:
        return False

    a = 2 * x - y // 2
    b = - x + y // 2

    return (0 <= a and 0 <= b)


if answer():
    print('Yes')
else:
    print('No')

Solution (Python):
x, y = map(int, input().split())
ans = y/2 - x
if ans == int(ans) and ans >= 0 and ans <= x:
    print('Yes')
else:
    print('No')

Solution (Python):
x,y=map(int,input().split())
f="No"
for i in range(x+1):
    if y==2*i+4*(x-i):
        f="Yes"
        break
print(f)

Solution (Python):
x, y = map(int, input().split())

if (4*x-y)%2 == 0 and 4*x-y >= 0 and 2*x <= y:
  print('Yes')
else:
  print('No')

Solution (Python):
import sys
X, Y = (int(x) for x in input().split())
for i in range(X+1):
    if Y == (2*i + 4*(X-i)):
        print('Yes')
        sys.exit()
print('No')

Solution (Python):
def main():
    x, y = list(map(int, input().split()))

    for idx in range(0, x + 1):
        if idx * 2 + (x - idx) * 4 == y:
            print('Yes')
            return

    print('No')

if __name__ == "__main__":
    main()

Solution (Python):
X, Y = map(int, input().split())
C = 2
T = 4

for t in range(X+1):
    if t * T + (X-t) * C == Y:
        print('Yes')
        exit()

print('No')

Solution (Python):
x, y = map(int, input().split())
if (2 * x <= y <= 4 * x) and y % 2 == 0:
    print("Yes")
else:
    print("No")

Solution (Python):
X,Y = map(int, input().split())

s=0
for i in range(X+1):
    if 2*i+4*(X-i)==Y:
        s+=1

if s==0:
    print('No')
else:
    print('Yes')

Solution (Python):

X,Y = map(int,input().split())
ans = 'No'
for i in range(0,X+1):
    if 2*i+4*(X-i)==Y:
        ans = 'Yes'
        break
print(ans)

Solution (Python):
X,Y=map(int,input().split())
if (4*X-Y)>=0 and (4*X-Y)%2==0 and (Y-2*X)>=0 and (Y-2*X)%2==0:
  print('Yes')
else:
  print('No')

Solution (Python):
l=list(map(int, input().split(' ')))
a=l[0]
b=l[1]
if b>=2*a and b<=4*a and b%2==0:
    print("Yes")
else:
    print("No")

Solution (Python):
x,y = map(int,input().split())
print("Yes" if 2*x <= y  and y <= 4*x and y%2 == 0 else "No")

Solution (Python):
X, Y = map(int, input().split())
ans = "No"
for turu in range(X+1):
    tmp = 2*turu + 4*(X-turu)
    if tmp == Y:
        ans = "Yes"
        break
print(ans)

Solution (Python):
import sys

sys.setrecursionlimit(10 ** 6)
int1 = lambda x: int(x) - 1
p2D = lambda x: print(*x, sep="\n")
def II(): return int(sys.stdin.readline())
def MI(): return map(int, sys.stdin.readline().split())
def LI(): return list(map(int, sys.stdin.readline().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def SI(): return sys.stdin.readline()[:-1]

def main():
    x,y=MI()
    if (y-2*x)%2==0 and (y-2*x)//2>=0 and x-(y-2*x)//2>=0:print("Yes")
    else:print("No")

main()

Solution (Python):
import sys

sys.setrecursionlimit(10 ** 6)
input = sys.stdin.readline
from math import floor, sqrt, factorial, hypot, log  
from heapq import heappop, heappush, heappushpop
from collections import Counter, defaultdict, deque
from itertools import accumulate, permutations, combinations, product, combinations_with_replacement
from bisect import bisect_left, bisect_right
from copy import deepcopy
from fractions import gcd
from random import randint


def ceil(a, b): return (a + b - 1) // b


inf = float('inf')
mod = 10 ** 9 + 7


def pprint(*A):
    for a in A:     print(*a, sep='\n')


def INT_(n): return int(n) - 1


def MI(): return map(int, input().split())


def MF(): return map(float, input().split())


def MI_(): return map(INT_, input().split())


def LI(): return list(MI())


def LI_(): return [int(x) - 1 for x in input().split()]


def LF(): return list(MF())


def LIN(n: int): return [I() for _ in range(n)]


def LLIN(n: int): return [LI() for _ in range(n)]


def LLIN_(n: int): return [LI_() for _ in range(n)]


def LLI(): return [list(map(int, l.split())) for l in input()]


def I(): return int(input())


def F(): return float(input())


def ST(): return input().replace('\n', '')


def main():
    X, Y = MI()
    for i in range(X + 1):
        if i * 4 + (X - i) * 2 == Y:
            print("Yes")
            sys.exit()
    print("No")

if __name__ == '__main__':
    main()

Solution (Python):
X,Y=map(int,input().split())
if Y-2*X>=0 and (Y-2*X)%2==0:
  a=int((Y-2*X)//2)
  if X-a>=0:
    print('Yes')
  else:
    print('No')
else:
  print('No')

Solution (Python):
x, y = map(int, input().split())
ok = False
for i in range(x+1):
  tmp = 2*i + 4*(x-i)
  if tmp == y:
    ok = True
    break

if ok:
  print("Yes")
else:
  print("No")

Solution (Python):
X,Y = map(int,input().split())
ans="No"

for i in range(0,X+1):
  j = X-i
  a = i*2 + j*4
  if a == Y:
    ans="Yes"
    break
print(ans)

Solution (Python):
x, y = map(int, input().split())

for t in range(0, x+1):
   k = x - t
   if t * 2 + k * 4 == y:
      print('Yes')
      exit()

print('No')

Solution (Python):
import sys
X, Y = map(int, input().split())
for i in range(X + 1):
    if i * 2 + (X - i) * 4 == Y:
        print('Yes')
        sys.exit()
print('No')

Solution (Python):
X, Y = map(int, input().split())
for a in range(X+1):
    b = X - a
    if 2 * a + 4 * b == Y:
        print('Yes')
        break
    if a == X:
        print('No')

Solution (Python):
X,Y = map(int,input().split())

ans = "No"

turtle2 = Y-2*X

if turtle2%2==0 and turtle2 >=0 and turtle2 <=X*2:
    ans = "Yes"

print(ans)

Solution (Python):
x,y=map(int,input().split())
i=0
ans="No"
while i<=x:
    if 2*i + 4*(x-i)==y:
        ans="Yes"
        break
    i+=1
print(ans)

Solution (Python):
x=list(map(int,input().split()))
if x[0]*2<=x[1] and x[1]<=x[0]*4 and x[1]%2 ==0:
  print("Yes")
else:
  print("No")

Solution (Python):
x, y = map(int, input().split())

is_exist = False
for a in range(51):
    for b in range(26):
        if a + b == x and a*2 + b*4 == y:
            is_exist = True
            break

if is_exist:
    print("Yes")
else:
    print("No")

Solution (Python):
x, y = map(int, input().split())
if (x*2 <= y <= x*4) and y%2==0:
    print("Yes")
else:
    print("No")

Solution (Python):
x, y = map(int, input().split())
print("Yes" if y % 2 == 0 and 4 * x >= y and 2 * x <= y else "No")

Solution (Python):
x, y = map(int, input().split())
if (4*x -y)%2 == 0:
    if 0 <= (4*x-y)/2<=x:
        print('Yes')
    else:
        print('No')
else:
    print('No')

Solution (Python):

import sys

sysread = sys.stdin.readline
read = sys.stdin.read
sys.setrecursionlimit(10 ** 7)











def run():
    X, Y = map(int, input().split())
    if (Y - 2 * X) >= 0 and (Y - 2 * X) % 2 == 0 and 4 * X >= Y:
        print('Yes')
    else:
        print('No')


if __name__ == "__main__":
    run()

Solution (Python):
X, Y = map(int, input().split())

if Y % 2 != 0:
    print("No")
elif not 2*X <= Y <= 4*X:
    print("No")
else:
    print("Yes")

Solution (Python):


X, Y = list(map(int,input().split()))

for a in range(X + 1):
    if a * 2 + (X - a) * 4 == Y:
        print("Yes")
        break
else:
    print("No")

Solution (Python):
X,Y = map(int,input().split())

for i in range(X+1):
    if i*2+(X-i)*4 == Y:
        print('Yes')
        exit()
print('No')

Solution (Python):
X, Y = map(int, input().split())

if 2 * X <= Y <= 4 * X and Y % 2 == 0:
    print("Yes")
else:
    print("No")

Solution (Python):
import sys

sys.setrecursionlimit(10 ** 7)
rl = sys.stdin.readline


def solve():
    X, Y = map(int, rl().split())
    
    for i in range(X + 1):
        if 2 * i + 4 * (X - i) == Y:
            print('Yes')
            return
    print('No')


if __name__ == '__main__':
    solve()

Solution (Python):
n_creature, n_legs = map(int,input().split())
res = 'No'
for n_turu in range(n_creature+1):
    if 2 * n_turu + 4 * (n_creature-n_turu) == n_legs:
        res = 'Yes'
print(res)

Solution (Python):


x, y = map(int, input().split())
if (x*2 <= y <= x*4) and (y%2 == 0):
    print("Yes")
else:
    print("No")

Solution (Python):
x,y = map(int, input().split())
flag = False
for turu in range(0,x+1):
  kame = x - turu
  if y == (turu*2 + kame*4):
    flag = True

if flag:
    print("Yes")
else:
    print("No")

Solution (Python):
X, Y = map(int, input().split())
for i in range(X + 1):
    j = X - i
    if i * 2 + j * 4 == Y:
        print("Yes")
        break
else:
    print("No")

Solution (Python):
X,Y = map(int,input().split())

flg = False 
for i in range(0,X+1):
    j = X - i
    if i*2 + j*4 == Y:
        flg = True
        break
    
if flg:
    print('Yes')
else:
    print('No')

Solution (Python):
line = input().split()
num = int(line[0])
leg = int(line[1])

if leg > 4 * num or leg < 2 * num or leg%2 != 0:
  ans = "No"

else:
  ans = "Yes"
  
print(ans)

Solution (Python):
X, Y = map(int, input().split())

lst = []
for i in range(X+1):
  lst.append(2*X + 2*i)

lst = set(lst)

if Y in lst:
  print('Yes')
else:
  print('No')

Solution (Python):
S=list(map(int,input().split()))

if S[1]%2==0:
  if S[0]*2<=S[1]<=S[0]*4:
    print("Yes")
  else:
    print("No")
else:
  print("No")

Solution (Python):



x,y=map(int,input().split())
if y%2!=0:
	print('No')
elif y>=x*2 and y<=x*4:
	print('Yes')
else:
	print('No')

Solution (Python):
x, y = map(int, input().split())
if(y % 2 == 0 and y >= 2*x and 4*x >= y):
    print("Yes")
else:
    print("No")

Solution (Python):
X, Y = [int(x) for x in input().split()]
if (Y - 2 * X) % 2 == 0 and 0 <= (Y - 2 * X) // 2 <= X:
    print("Yes")
else:
    print("No")

Solution (Python):
x,y = map(int,input().split())
if y%2==0 and 2*x <= y and y <= 4*x:
  print("Yes")
else:
  print("No")

Solution (Python):


from pprint import pprint
from collections import deque, defaultdict
import itertools
import math
import sys

sys.setrecursionlimit(10 ** 6)
input = sys.stdin.buffer.readline
INF = float('inf')


x, y = map(int, input().split())

if y % 2 == 1:
    print('No')
else:
    if x * 2 <= y <= x * 4:
        print('Yes')
    else:
        print('No')

Solution (Python):
X, Y = map(int,input().split())
exist = 0
for x in range(X+1):
  if x*2 + (X-x)*4 == Y:
    exist = 1
    break
print("Yes" if exist == 1 else "No")

Solution (Python):
X, Y = map(int, input().split())

b = (2 * X - Y) / (-2)
a = X - b

b1 = int(b)
a1 = int(a)

if (b1 < 0 or b1 != b) or (a1 < 0 or a1 != a):
    print('No')
else:
    print('Yes')

Solution (Python):
X, Y = map(int, input().split())

if X * 4 < Y or X * 2 > Y:
    print('No')
elif Y % 2 == 1:
    print('No')
else:
    print('Yes')

Solution (Python):
X, Y = map(int, input().split())

for a in range(X + 1):
    b = X - a
    if a * 2 + b * 4 == Y:
        print('Yes')
        exit()
print('No')

Solution (Python):
x, y = map(int, input().split())

for i in range(x+1):
    if i * 2 + (x-i) * 4 == y:
        print('Yes')
        exit(0)
print('No')

Solution (Python):
x,y=map(int,input().split())
if x*4<y or 2*x>y or y%2==1:
	print('No')
else:
	print('Yes')

Solution (Python):
x,y=map(int,input().split())
if y%2: print('No')
else:
    z=0
    for i in range(x+1):
        if 4*i+2*(x-i)==y:
            z=1
            break
    if z: print('Yes')
    else: print('No')

Solution (Python):
x,y=map(int,input().split())
if y%2==0:
    if 2*x-y//2>=0 and y//2-x>=0:
        print("Yes")
    else:
        print("No")
    exit()
else:
    print("No")
    exit()