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):
import sys
import copy
from collections import deque
stdin = sys.stdin

mod = 10**9+7

ni = lambda: int(ns())
na = lambda: list(map(int, stdin.readline().split()))
ns = lambda: stdin.readline().rstrip()  

x, y = na()

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

Solution (Python):
import numpy as np
import sys
import math
import itertools
import collections

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

for k in range(0,101):
    for t in range(0,101):
        if k+t == 0:
            continue
        if x == k+t and y == (4*k)+(t*2):
            print("Yes")
            sys.exit()

print("No")

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

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

if (0 <= a) and (0 <= b):
  if (a % 1 == 0) and (b % 1 == 0):
    print("Yes")
    quit()
    
print("No")

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

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

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

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

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

kame=0
turu=0

asi=0
flag=0

for kame in range(0,x+1):
    asi=kame*4 +(x-kame)*2
    
    if asi==y:
        print("Yes")
        flag=1
        break

if flag==0:
    print("No")

Solution (Python):
from sys import stdin
X,Y = [int(x) for x in stdin.readline().rstrip().split()]
f = False
for i in range(0,X+1):
    j = X - i
    if i*2 + j*4 == Y:
        f = True
            
if f:
    print("Yes")
else:
    print("No")

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

for turu in range(X+1):
    kame = X - turu
    if 2 * turu + 4 * kame == Y:
        flag = True
print('Yes' if flag else 'No')

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

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

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

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

Solution (Python):
"""    Arnab Chanda    """

from collections import defaultdict, deque
from itertools import permutations
from sys import stdin,stdout
from bisect import bisect_left, bisect_right
from copy import deepcopy
import heapq

int_input=lambda : int(stdin.readline())
string_input=lambda : stdin.readline().split()
multi_int_input =lambda : map(int, stdin.readline().split())
multi_input = lambda : stdin.readline().split()
list_input=lambda : list(map(int,stdin.readline().split()))
string_list_input=lambda: list(string_input())
MOD = pow(10,9)+7

x, y = multi_int_input()

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

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

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

Solution (Python):
from collections import defaultdict
it = lambda: list(map(int, input().strip().split()))
INF = float('inf')

def solve():
    X, Y = it()
    if Y % 2:
        return False
    return 4 * X >= Y >= 2 * X

if __name__ == '__main__':
    if not solve():
        print('No')
    else:
        print('Yes')

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

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

Solution (Python):
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10 ** 7)
import bisect
import numpy as np
import math
from collections import deque
from collections import defaultdict
from math import gcd


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

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

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

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

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

Solution (Python):
import sys


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


if __name__ == '__main__':
    main()

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

Solution (Python):
def main():
    X,Y  = map(int, input().split()) 
    XY = [False]*(600)
    for i in range(X+1):
        XY[(X-i)*2+i*4]=True
    if XY[Y]:
        print('Yes')
    else:
        print('No')


if __name__ == '__main__':
    main()

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

if __name__ == "__main__":
    print(main(X,Y))

Solution (Python):

import sys
import math
import itertools
import collections

def solve(X,Y):
    for i in range(X+1):
        j = X - i
        if(i * 2 + j * 4 == Y):
            return "Yes"
    else:

        return "No"
def main():
    X,Y = map(int,input().split())
    
    print(solve(X,Y))

if __name__ == "__main__":
    main()

Solution (Python):



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


is_ok = False


for a in range(X+1):
    b = X - a
    if (2*a + 4*b)==Y:
        is_ok = True


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

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

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):
x, y = map(int, input().split())
ans = "No"
for a in range(100):
    for b in range(100):
        if a + b == x and 2 * a + 4 * b == y:
            ans = "Yes"
print(ans)

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

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

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

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

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

print("No")

Solution (Python):

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

Solution (Python):

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

if Y%2!=0:
    print("No")
elif 2*X<=Y<=X*4:
    print("Yes")
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())

z = y%2

if z !=0:
    print("No")
    exit()
    
if y >= 2*x and y <= 4*x:
    print("Yes")

else:
    print("No")

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

Solution (Python):

a, b = map(int, input().split())









ans1 = ((b - 2 * a) % 2) == 0
x2 = b - 2 * a
ans = True
if x2 % 2 != 0:
    ans = False
if x2 < 0:
    ans = False
x2 = x2 // 2
if a - x2 < 0:
    ans = False
if ans:
    print("Yes")
else:
    print("No")

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

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

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

Solution (Python):
x, y = 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):
import sys

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

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

Solution (Python):

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

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

print('No')

Solution (Python):
import itertools,sys
def LI(): return list(map(int,sys.stdin.readline().rstrip().split()))
X,Y = LI()
for x,y in itertools.product(range(X+1),range(Y+1)):
    if x+y==X and 2*x+4*y==Y:
        print('Yes')
        break
else:
    print('No')

Solution (Python):
import sys
readline = sys.stdin.buffer.readline
def even(n): return 1 if n%2==0 else 0

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

if not even(y):
    print("No")
    exit()

mn = 2*x
mx = 4*x

if mn <= y <= mx:
    print("Yes")
else:
    print("No")

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

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

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

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

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

Solution (Python):
import sys
sys.setrecursionlimit(10**6)


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


if __name__ == '__main__':
    main(sys.stdin.readline, print)

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

for i in range(x+1):
  if i*2 + (x-i)*4 == y:
    ans = "Yes"

print(ans)

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

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

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

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

ans = "Yes"

if Y % 2 == 1:
    ans = "No"
else:
    Y //= 2
    mi = (Y+1)//2
    if mi <= X <= Y:
        pass
    else:
        ans = "No"

print(ans)

Solution (Python):
X, Y = map(int, input().split())
if Y > 4*X:
    print("No")
    exit()

if Y % 2 != 0:
    print("No")
    exit()

if Y < 2*X:
    print("No")
    exit()


print("Yes")

Solution (Python):
X, Y = [int(x) for x in 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())

bool = False

for i in range(x + 1):
    turu = i
    kame = x - i
    if turu * 2 + kame * 4 == y:
        bool = True

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

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

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

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

ans = "Yes"
if (Y % 2 == 1):
  ans = "No"
elif (X*4 < Y):
  ans = "No"
elif (Y < X * 2):
  ans = "No"

  
print(ans)

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

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

if y<2*x or y>4*x:
    print('No')
    exit(0)
b=y-2*x
if b>2*x:
    print('No')
    exit(0)

print('Yes')

Solution (Python):
import sys
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")
            sys.exit()
print("No")

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

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

Solution (Python):
import math as mt


def ro(n):
  return mt.floor(mt.sqrt(n))
def ya():
  print("Yes")
  return
def na():
  print("No")
  return


a,b=map(int,input().split())




if b%2:
  na()
elif b>a*4:
  na()
elif a*2>b:
  na()
else:
  ya()

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

Solution (Python):


a,b = map(int,input().split())
count = 0
for i in range(a + 1):
    if (i * 2 + (a - i) * 4) == b:
        count += 1
if count == 0:
    print("No")
else:
    print("Yes")

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

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

j=0
b=0
for i in range(x+1):
    a=0
    j=x-i
    a=i*2+j*4
    if a==y:
        b=1

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

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

Solution (Python):
def getN():
    return int(input())
def getNM():
    return map(int, input().split())
def getList():
    return list(map(int, input().split()))
def getArray(intn):
    return [int(input()) for i in range(intn)]
def input():
    return sys.stdin.readline().rstrip()
def rand_N(ran1, ran2):
    return random.randint(ran1, ran2)
def rand_List(ran1, ran2, rantime):
    return [random.randint(ran1, ran2) for i in range(rantime)]
def rand_ints_nodup(ran1, ran2, rantime):
  ns = []
  while len(ns) < rantime:
    n = random.randint(ran1, ran2)
    if not n in ns:
      ns.append(n)
  return sorted(ns)

def rand_query(ran1, ran2, rantime):
  r_query = []
  while len(r_query) < rantime:
    n_q = rand_ints_nodup(ran1, ran2, 2)
    if not n_q in r_query:
      r_query.append(n_q)
  return sorted(r_query)

from collections import defaultdict, deque, Counter
from sys import exit
from decimal import *
import heapq
import math
from fractions import gcd
import random
import string
import copy
from itertools import combinations, permutations, product
from operator import mul
from functools import reduce
from bisect import bisect_left, bisect_right

import sys
sys.setrecursionlimit(1000000000)
mod = 10 ** 9 + 7






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

Solution (Python):
anims, legs = map(int, input().split(' '))

for crane in range(anims + 1):
    if crane * 2 + (anims - crane) * 4 == legs:
        print("Yes")
        exit()

print("No")

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

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

if count == X+1:
    print('No')

Solution (Python):
x, y = map(int, input().split())
flag = 0
for a in range(101):
    for b in range(101):
        if a + b == x:
            if 2 * a + 4 * b == y:
                flag = 1
print('Yes' if flag else 'No')

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

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

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

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

Solution (Python):
x, y = list(map(int, input().split()))
if 4*x < y:
  print("No")
  quit()

if (4*x-y)% 2== 1:
  print("No")
  quit()

if (4*x-y)/2 > x:
  print("No")
  quit()

print("Yes")

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

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

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

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

for i in range(101):
  for j in range(101):
    if i+j == x and 2*i+4*j == y:
      print ('Yes')
      exit()
print ('No')

Solution (Python):
n,m=map(int, input().split())
if(m%2==1):
  print("No")
else:
  m=m//2
  if(n<=m and 2*n>=m):
    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()

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

Solution (Python):
X_hiki, Y_hon = map(int, input().split())

ans = 'No'

for i in range(X_hiki + 1):
    hon = 2 * i + 4 * (X_hiki - i)
    
    if (hon == Y_hon):
        ans = 'Yes'
        break

print(ans)

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 k in range(101):
    for l in range(101):
        if k*2 + l*4 ==Y and X ==k+l:
            flag = True
            break
            
if flag == True:
    print("Yes")
else:
    print("No")

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

Solution (Python):

import sys

YES = "Yes"  
NO = "No"  


def solve(X: int, Y: int):
    for i in range(0,X+1):
        if i*2 + 4*(X-i) == Y:
            print(YES)
            exit()
    print(NO)
    exit()
    return



def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    X = int(next(tokens))  
    Y = int(next(tokens))  
    solve(X, Y)

if __name__ == '__main__':
    main()

Solution (Python):
x,y = map(int,input().split())
if y % 2 != 0:
    print("No")
    exit()
a = y//2-x
b = 2*x-y//2
if a >= 0 and b >= 0:
    print("Yes")
else:
    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")
        quit()
print("No")

Solution (Python):
import sys
a=input()
a0=a.split()
x=int(a0[0])
y=int(a0[1])
if y%2==1:
    print("No")
    sys.exit()
if y/2<x:
    print("No")
    sys.exit()
if y/4>x:
    print("No")
    sys.exit()
print("Yes")

Solution (Python):
A,B = list(map(int, input().split()))
if (B % 2) == 0:
    hi = A*4
    lo = A*2
    if B>=lo and B <= hi:
        print("Yes")
    else:
        print("No")
else:
    print("No")

Solution (Python):
X, Y = map(int, input().split())
a = 2 * X - Y // 2
b = Y // 2 - X
ans = 'Yes'
if a<0 or b<0 or Y%2==1:
  ans = 'No'
print(ans)

Solution (Python):




def input_int():
    return int(input())



def int1(x):
    return int(x) - 1



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



def input_to_int_tuple():
    return tuple(map(int, input().split()))



def input_to_int_tuple_minus1():
    return tuple(map(int1, input().split()))


def main():
    x, y = input_to_int_map()

    for i in range(0, x + 1):
        kame = i
        turu = x - i

        if ((kame * 4) + (turu * 2)) == y:
            return "Yes"

    return "No"


if __name__ == "__main__":
    print(main())

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

val=Y-2*X

if val%2==0:
    y=val//2
    if y>X:
        print("No")
        exit()
    if val>=0:
        print("Yes")
        exit()

print("No")

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

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

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

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

Solution (Python):

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

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

main()

Solution (Python):
import sys, re, os
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians

from itertools import permutations, combinations, product, accumulate
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from functools import reduce
from bisect import bisect_left, insort_left
from heapq import heapify, heappush, heappop

INPUT = lambda: sys.stdin.readline().rstrip()
INT = lambda: int(INPUT())
MAP = lambda: map(int, INPUT().split())
S_MAP = lambda: map(str, INPUT().split())
LIST = lambda: list(map(int, INPUT().split()))
S_LIST = lambda: list(map(str, INPUT().split()))

sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7


def main():
    X, Y = MAP()

    l = [i for i in range(2*X, 4*X + 2, 2)]
    print('Yes' if Y in l else 'No')


if __name__ == '__main__':
    main()

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

import sys
for a in range(x+1):
    if 2*a+4*(x-a)==y:
        print('Yes')
        sys.exit()

print('No')

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

at = XY[0] * 4
ac = XY[0] * 2

if (at < XY[1] or ac > XY[1]):
    print("No")
    exit()
if (XY[1] % 2 == 1):
    print("No")
else:
    print("Yes")

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

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

Solution (Python):
'''
Author : Shubhanshu Jain;
'''

import math
import random;
from collections import defaultdict 
mod =1000000007
r1 = lambda : int(input());
rm = lambda : map(int,input().split());
rms = lambda : map(str,input().split());
rls = lambda : list(rm())

def solve():
    a,l = rm();
    if(a*4>=l and a*2<=l and l%2==0):
        print("Yes");
    else:
        print("No")
        
        





def def_value(): 
	return "nan"
	
solve();

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

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

for i in range(x+1):
  if asi==y:
    print("Yes")
    exit()
  asi+=2
  
print("No")

Solution (Python):
import sys
import math
import heapq
sys.setrecursionlimit(10**7)
INTMAX = 9223372036854775807
INTMIN = -9223372036854775808
DVSR = 1000000007
def POW(x, y): return pow(x, y, DVSR)
def INV(x, m=DVSR): return pow(x, m - 2, m)
def DIV(x, y, m=DVSR): return (x * INV(y, m)) % m
def LI(): return [int(x) for x in sys.stdin.readline().split()]
def LF(): return [float(x) for x in sys.stdin.readline().split()]
def LS(): return sys.stdin.readline().split()
def II(): return int(sys.stdin.readline())
def FLIST(n):
    res = [1]
    for i in range(1, n+1): res.append(res[i-1]*i%DVSR)
    return res

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

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

print(ans)

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


if __name__ == '__main__':
    main()

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


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

print("No")

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

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

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

f = 0

for i in range(0, x+1):
    if i*2 + (x-i)*4 == y:
        f = 1

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

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

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

flag = False

for i in range(x+1):
    tsuru = i
    kame = x - i
    if 2 * tsuru + 4 * kame == y:
        flag = True
        break

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

Solution (Python):
x,y=map(int,input().split())
n=(y-2*x)/2
m=(4*x-y)/2
if n>=0 and m>=0 and n.is_integer() and m.is_integer():
  print('Yes')
else:
  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):
def main():
    import sys
    sys.setrecursionlimit(10**9)
    input = sys.stdin.readline

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

main()

Solution (Python):
import sys
from collections import defaultdict
readline = sys.stdin.buffer.readline



def geta(fn=lambda s: s.decode()):
    return map(fn, readline().split())


def gete(fn=lambda s: s.decode()):
    return fn(readline().rstrip())


def main():
    x, y = geta(int)

    m2, n2 = y - 2 * x, 4 * x - y

    if m2 & 1 == 0 and n2 & 1 == 0 and m2 >= 0 and n2 >= 0:
        print("Yes")
    else:
        print("No")


if __name__ == "__main__":
    main()

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

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

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

Solution (Python):
import numpy as np
import functools
import operator
import sys 

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

for x in range(X + 1):
    
    

    val = 2 * x + 4 * (X - x)
    

    if val == Y:
        print('Yes')

        sys.exit()

print('No')

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

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

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

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):
a = list(map(int, input().split()))
if 2*a[0]<=a[1]<=a[0]*4 and a[1]%2==0:
    print('Yes')
else:
    print('No')

Solution (Python):
import sys
sys.setrecursionlimit(10**6)



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











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

if b >= 0 and b == int(b) and a >= 0 and a == int(a):
    print('Yes')
else:
    print('No')

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

x = 2.0*X - Y/2.0
y = Y/2.0 - X

if x >= 0 and y >= 0 and x == int(x) and y == int(y):
    print("Yes")
else:
    print("No")

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

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

Solution (Python):
def main():
    X, Y = map(int, input().split())
    if Y%2:
        return 'No'
    Y //= 2
    if X <= Y <= 2*X:
        return 'Yes'
    else:
        return 'No'

print(main())

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

for a in range(101):
    for b in range(101):
        if a+b == X and 2*a+4*b == Y:
            f = True
            break

if f:
    print("Yes")
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")
        quit()

print("No")

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


check = 0
for i in range(101):
    for j in range(101):
        if (i * 2 + j * 4 == y) and i + j == x:
            check = 1
if check == 1:
    print('Yes')
else:
    print('No')

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

print("No")

Solution (Python):
N, L = map(int, input().split())
res = "No"
for i in range(N+1):
  chall = 2*i + 4 * (N-i)
  if chall == L:
    res = "Yes"
  else:
    pass
print(res)

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

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

count = 0

for i in range(x+1):
    if (i*2 + (x-i)*4) == y:
        count += 1

if count > 0:
    print("Yes")
else:
    print("No")

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

if (Y - 2 * X) % 2 > 0:
    print('No')
    exit()

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

if b >= 0 and a >= 0:
    print('Yes')
else:
    print('No')

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

answer = "No"
for i in range(X + 1):
    tsuru = i
    kame = X - i
    if tsuru * 2 + kame * 4 == Y:
        answer = "Yes"
        break

print(answer)

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

if (4 * X - Y) % 2 != 0:
    print("No")
    exit()

c = (4 * X - Y) // 2
t = X - c

if c >= 0 and t >= 0:
    print("Yes")
else:
    print("No")