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
X,Y=map(int, input().split())
for i in range(X+1):
    ans=i*2+(X-i)*4
    if ans==Y:
        print("Yes")
        sys.exit()
print("No")

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

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

if FLG:
    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())

foot = 0
for i in range(x):
  foot += 4
  
ok = False
if foot == y:
  ok = True
for i in range(x):
  foot -= 2
  if foot == y:
    ok = True

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

Solution (Python):

import sys

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


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


if __name__ == '__main__':
    main()

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

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

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

print('No')

Solution (Python):
X,Y = list(map(int,input().split()))
for i in range(X+1):
    if 2*i+4*(X-i) == Y:
        print("Yes")
        break
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):
import sys


def input(): return sys.stdin.readline().strip()
def I(): return int(input())
def LI(): return list(map(int, input().split()))
def IR(n): return [I() for i in range(n)]
def LIR(n): return [LI() for i in range(n)]
def SR(n): return [S() for i in range(n)]
def S(): return input()
def LS(): return input().split()


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

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

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

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

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

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

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

flag = False
for i in range(x+1):
    turu = x - i
    kame = i

    if (turu * 2 + kame * 4) == y:
        flag = True
        break

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

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

if 2*X <= Y and Y <= 4*X and Y % 2 != 1:
    print("Yes")
else:
    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):
def main():
    x, y = map(int, input().split())

    res = 'No'

    for i in range(x+1):
        crane = i
        turtle = x - i

        if crane*2 + turtle*4 == y:
            res = 'Yes'
            break
    
    print(res)

if __name__ == '__main__':
    main()

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

Solution (Python):
import sys,queue,math,copy,itertools,bisect,collections,heapq

def main():
    sys.setrecursionlimit(10**7)
    INF = 10**18
    MOD = 10**9 + 7
    LI = lambda : [int(x) for x in sys.stdin.readline().split()]
    _LI = lambda : [-int(x) for x in sys.stdin.readline().split()]
    NI = lambda : int(sys.stdin.readline())
    SI = lambda : sys.stdin.readline().rstrip()
    DD = ((1,0),(0,1),(-1,0),(0,-1))

    x,y = LI()

    n = x * 4 - y
    if n % 2:
        print('No')
        return
    if 0 <= n // 2 <= x:
        print('Yes')
    else:
        print('No')


if __name__ == '__main__':
    main()

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

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

Solution (Python):
x,y=map(int,input().split())
c=0
z=y//2

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

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

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

print('No')

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


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


if __name__ == '__main__':
    main()

Solution (Python):
x, y = map(int, input().split())
a = 0
flag = 1
while a <= 100:
    b = x-a
    if b >= 0 and 2*a + 4*b == y:
        print("Yes")
        flag = 0
        break
    a+=1
if flag:
    print("No")

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

    if y%2 :
        return "No"
        
    a = y-(2*x)
    if a%2 or a<0 :
        return "No"
    
    a = a//2
    if x-a < 0 :
        return "No"

    return "Yes"

print(solve())

Solution (Python):
import sys
from io import StringIO
import unittest


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

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

class TestClass(unittest.TestCase):
    def assertIO(self, input, output):
        stdout, stdin = sys.stdout, sys.stdin
        sys.stdout, sys.stdin = StringIO(), StringIO(input)
        resolve()
        sys.stdout.seek(0)
        out = sys.stdout.read()[:-1]
        sys.stdout, sys.stdin = stdout, stdin
        self.assertEqual(out, output)

    def test_入力例_1(self):
        input = """3 8"""
        output = """Yes"""
        self.assertIO(input, output)

    def test_入力例_2(self):
        input = """2 100"""
        output = """No"""
        self.assertIO(input, output)

    def test_入力例_3(self):
        input = """1 2"""
        output = """Yes"""
        self.assertIO(input, output)


if __name__ == "__main__":
    
    resolve()

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

Solution (Python):

MOD = 10 ** 9 + 7
INFI = 10**10

import math
from collections import deque
import itertools
import heapq

from fractions import Fraction
import copy
from functools import lru_cache
from collections import defaultdict
import pprint


def sosuhante(n):
    for k in range(2, int(math.sqrt(n))+1):
        if n% k ==0:
            return False
    return True
def cmb(n, r):
    if n - r < r: r = n - r
    if r == 0: return 1
    if r == 1: return n

    numerator = [n - r + k + 1 for k in range(r)]
    denominator = [k + 1 for k in range(r)]

    for p in range(2,r+1):
        pivot = denominator[p - 1]
        if pivot > 1:
            offset = (n - r) % p
            for k in range(p-1,r,p):
                numerator[k - offset] /= pivot
                denominator[k] /= pivot

    result = 1
    for k in range(r):
        if numerator[k] > 1:
            result *= int(numerator[k])

    return result

def kingaku(a,b,n):
    keta=len(str(n))
    return a*n+b*keta

def my_index(l, x, default=False):
    if x in l:
        return l.index(x)
    else:
        return default




def ret(a):
    c=[None]*(len(a)-1)
    if len(a)==1:
        return a[0]
    elif len(a)==0:
        return 0
    for i in range(1,len(a)):
        c[i-1]=abs(a[i]-a[i-1])
    return ret(c)

def soinsubunkai(n):
    a = []
    i = 1
    while i*i <= n:
        if n % i == 0 and i!=1:
            a.append(i)
            n=n//i

        if n% i !=0 or i==1:
            i += 1
    nokori=[n]
    return a + nokori

def main():
    x,y=map(int,input().split())
    ans="No"
    if y%2==0:
        if x>=-(y//-4):
            if x<=y//2:
                ans="Yes"
    print(ans)






if __name__ == "__main__":

    main()

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

    print("No")

resolve()

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

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

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

c = 0

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


if c != 0:
    print('Yes')

else:
    print('No')

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

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

min_leg = X*2
max_leg = X*4

if min_leg <= Y <= max_leg and Y % 2 == 0:
  print('Yes')
else:
  print('No')

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

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

Solution (Python):
import itertools
from collections import deque,defaultdict,Counter
from itertools import accumulate
import bisect
from heapq import heappop,heappush,heapify
import math
from copy import deepcopy
import queue
import numpy as np

Mod = 1000000007
fact = [1, 1]
factinv = [1, 1]
inv = [0, 1] 
for i in range(2, 10**5 + 1):
    fact.append((fact[-1] * i) % Mod)
    inv.append((-inv[Mod % i] * (Mod // i)) % Mod)
    factinv.append((factinv[-1] * inv[-1]) % Mod)
    
def cmb(n, r, p):
    if (r < 0) or (n < r):
        return 0
    r = min(r, n - r)
    return fact[n] * factinv[r] * factinv[n - r] % p
    
def sieve_of_eratosthenes(n):
    if not isinstance(n,int):
        raise TypeError("n is not int")
    if n<2:
        raise ValueError("n is not effective")
    prime = [1]*(n+1)
    for i in range(2,int(math.sqrt(n))+1):
        if prime[i] == 1:
            for j in range(2*i,n+1):
                if j%i == 0:
                    prime[j] = 0
    res = []
    for i in range(2,n+1):
        if prime[i] == 1:
            res.append(i)
    return res

 
class UnionFind:
    def __init__(self,n):
        self.parent = [i for i in range(n+1)]
        self.rank = [0 for i in range(n+1)]
    
    def findroot(self,x):
        if x == self.parent[x]:
            return x
        else:
            y = self.parent[x]
            y = self.findroot(self.parent[x])
            return y
    
    def union(self,x,y):
        px = self.findroot(x)
        py = self.findroot(y)
        if px < py:
            self.parent[y] = px
        else:
            self.parent[px] = py
 
    def same_group_or_no(self,x,y):
        return self.findroot(x) == self.findroot(y)

def main():  
    x, y = map(int, input().split())
    ans = 0
    for i in range(101):
        for j in range(101):
            if 2 * i + 4 * j == y and i + j == x:
                ans = 1
    print("Yes" if ans else "No")
                
if __name__ == "__main__":
    main()

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")
        exit(0)
print("No")

Solution (Python):

X,Y = map(int,input().split())
ans = "No"
for i in range(X+1):

    j = X-i

    if i*2+4*j == Y:
        ans = "Yes"

print (ans)

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

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

flag = False
for i in range(X+1):
    kame = i
    turu = X - i

    if kame * 4 + turu * 2 == Y:
        flag = True

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

Solution (Python):
a,b=[int(i) for i in input().split(" ")]
x=2*a-b/2
y=b/2-a

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

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

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

print("No")

Solution (Python):
from sys import stdin

def main():

    input = stdin.readline

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

    max_ashi = X * 4
    min_ashi = X * 2

    if (Y <= max_ashi) & (min_ashi <= Y) & (Y % 2 == 0):
        print("Yes")
    else:
        print("No")


if __name__ == "__main__":
    main()

Solution (Python):
INT = lambda: int(input())
INTM = lambda: map(int,input().split())
STRM = lambda: map(str,input().split())
STR = lambda: str(input())
LIST = lambda: list(map(int,input().split()))
LISTS = lambda: list(map(str,input().split()))
def do():
    a,b=INTM()
    t=max(0,(a*4-b)//2)
    k=max(a-t,0)
    if k*4+t*2==b:
        print('Yes')
    else:
        print('No')
    
if __name__ == '__main__':
    do()

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

for k in range(100):
    for t in range(100):
        if k + t == x and 2*t + 4*k == y:
            print('Yes')
            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')
        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')
        break
    
else:print('No')

Solution (Python):
import itertools
import copy
from collections import deque
import heapq
x,y = map(int,input().split())
mi = 2*x
ma = 4*x
if y % 2 == 0:
    if mi <= y and ma >= y:
        print("Yes")
    else:
        print("No")
else:
    print("No")

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

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

if counter :
    print("Yes")

else:
    print("No")

Solution (Python):
import sys

read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline

in_n = lambda: int(readline())
in_nn = lambda: map(int, readline().split())
in_s = lambda: readline().rstrip().decode('utf-8')


def main():

    X, Y = in_nn()

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

    print(ans)


if __name__ == '__main__':
    main()

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

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

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

    for t in range(x+1):
        k = x - t
        t_l = t * 2
        k_l = k * 4
        if y == t_l+k_l:
            print('Yes')
            return
    print('No')
if __name__=='__main__':
    main()

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


if __name__ == '__main__':
    solve()

Solution (Python):
x,y = map(int,input().split())
ok = False
for i in range(x+1):
    rest = x - i
    if i * 2 + rest * 4 == y:
        ok = True
if ok: 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):
from collections import *
from math import *

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

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

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

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

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

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

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

a = 0
b = X

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

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())

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

print('Yes' if ck else 'No')

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

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

print("No")

Solution (Python):
import sys

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

k=0
t=0

for i in range(x+1):
  k=i
  t=x-i

  a=(k*4)+(t*2)

  if a==y:
    print("Yes")
    sys.exit()

print("No")

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

if Y >= 2*X and Y <= 4*X 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//2>=0 and y//2-x>=0:
    print("Yes")
else:
    print("No")

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

if __name__ == '__main__':
    main()

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

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

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

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

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

Solution (Python):
MOD = 10**9+7

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

def ii():
    return int(input())

def main():
    X, Y = list(mi())
    if 4*X-Y >= 0 and (4*X-Y)%2 == 0 and (4*X-Y)//2<= X:
        print('Yes')
    else:
        print('No')


if __name__ == '__main__':
    main()

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

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())
if y%2==0:
    if x*2<=y<=x*4:
        print('Yes')
    else:
        print('No')
else:
    print('No')

Solution (Python):

import sys

YES = "Yes"  
NO = "No"  


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



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))  
    print(solve(X, Y))

def test():
    import doctest
    doctest.testmod()

if __name__ == '__main__':
    
    main()

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')
        exit()
print('No')

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

x,y=map(int,input().split())
if y<=x*4 and 2*x<=y and y%2==0:
    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')
        break
else:
    print('No')

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


if __name__ == '__main__':
    resolve()

Solution (Python):
import sys
sys.setrecursionlimit(10**6)
from math import floor,ceil,sqrt,factorial,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 operator import itemgetter
from fractions import gcd
mod = 10 ** 9 + 7
inf = float('inf')
ninf = -float('inf')
'''


 
import numpy as np
from scipy.sparse.csgraph import shortest_path, floyd_warshall, dijkstra, bellman_ford, johnson
from scipy.sparse import csr_matrix
'''
 

def ii(): return int(sys.stdin.readline().rstrip()) 
def mii(): return map(int,sys.stdin.readline().rstrip().split())
def limii(): return list(mii()) 
def lin(n:int): return [ii() for _ in range(n)]
def llint(n: int): return [limii() for _ in range(n)]

def ss(): return sys.stdin.readline().rstrip() 
def mss(): return sys.stdin.readline().rstrip().split()
def limss(): return list(mss()) 
def lst(n:int): return [ss() for _ in range(n)]
def llstr(n: int): return [limss() for _ in range(n)]






x,y=mii()

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

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

Solution (Python):
x, y = map(int, input().split())
for i in range(x+1):
    if i * 2 + (x-i) * 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(0)
print('No')

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

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

if Y % 2 == 1:
    print('No')
    exit(0)

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

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

isYes = True

if y % 2 != 0:
    isYes = False

if x * 2 > y:
    isYes = False

if x * 4 < y:
    isYes = False

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

Solution (Python):


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

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

        if kame*4 + turu*2 == Y:
            print("Yes")
            return
    print("No")


if __name__ == "__main__":
    solve()

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

Solution (Python):
def main():
    answer = "No"
    head,leg = map(int,input().split())
    for tsuru in range(0,head+1):
        kame = head - tsuru
        if tsuru * 2 + kame * 4 == leg:
            answer = "Yes"
            break

    print(answer)



if __name__ == '__main__':
    main()

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())
OK=False
for i in range(0,X+1):
    if 2*i+4*(X-i) == Y:
        OK=True
print("Yes" if OK else "No")

Solution (Python):
X,Y = list(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())
a=y-2*x
b=4*x-y

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

Solution (Python):
import sys

X, Y = map(int, 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()
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')
        break
else:
    print('No')

Solution (Python):

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

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

  print("No")


main()

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

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

Turu = 0
Kame = X

while 'true':
    if Turu * 2 + Kame * 4 == Y:
        print('Yes')
        break
    else:
        Turu += 1
        Kame -= 1
    
    if Kame < 0:
        print('No')
        break