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())
for i in range(26):
    for j in range(51):
        if i*4+j*2==Y and i+j==X:
            print("Yes")
            exit()
else:
    print("No")

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

for x in range(10000):
    y = X-x
    if y < 0:
        continue
    z = x*2+4*y
    if z == Y:
        print('Yes')
        break
else:
    print('No')

Solution (Python):
from heapq import heappush, heappop, heapify
from collections import deque, defaultdict, Counter
import itertools
from itertools import permutations, combinations, accumulate, product, combinations_with_replacement
import sys
import bisect
import string
import math
import time


def I(): return int(input())
def S(): return input()
def MI(): return map(int, input().split())
def MS(): return map(str, input().split())
def LI(): return [int(i) for i in input().split()]
def LI_(): return [int(i)-1 for i in input().split()]
def StoI(): return [ord(i)-97 for i in input()]
def ItoS(nn): return chr(nn+97)
def input(): return sys.stdin.readline().rstrip()
def list2d(a, b, c): return [[c] * b for i in range(a)]
def list3d(a, b, c, d): return [[[d] * c for j in range(b)] for i in range(a)]
def list4d(a, b, c, d, e): return [[[[e] * d for j in range(c)] for j in range(b)] for i in range(a)]
def print_matrix(mat):
    for i in range(len(mat)):
        print(*['IINF' if v == IINF else "{:0=4}".format(v) for v in mat[i]])


yn = {False: 'No', True: 'Yes'}
YN = {False: 'NO', True: 'YES'}
MOD = 10**9+7
inf = float('inf')
IINF = 10**19
l_alp = string.ascii_lowercase
u_alp = string.ascii_uppercase
ts = time.time()
sys.setrecursionlimit(10**6)
nums = ['1', '2', '3', '4', '5', '6', '7', '8', '9', '10']
show_flg = False



def main():
    X, Y = MI()
    ans = 0

    for i in range(100):
        for j in range(100):
            if X == (i + j) and (2 * i + 4 * j) == Y:
                ans += 1

    print(yn[ans >= 1])


if __name__ == '__main__':
    main()

Solution (Python):
X, Y = map(int, input().split())
maxX = X * 4
minX = X * 2
if Y %2 == 0 and minX <= Y <= maxX:
    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):
def LI():return list(map(int,input().split()))
def MI():return map(int,open(0).read().split())
def I():return int(input())
def yes():print("Yes")
def no():print("No")

from collections import deque, Counter
from heapq import heappop, heappush
INF=float("inf")




x,y=LI()

for a in range(0,x+1):
    b=x-a
    if b>=0 and 2*a+4*b==y:
        yes()
        exit()
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())
ttt=0
for i in range(0, x+1):
  if i*2+(x-i)*4==y:
    ttt=1
    print("Yes")
    break
if ttt==0:
  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())

for a in range(x + 1):
    b = x - a
    leg = a * 2 + b * 4
    if leg == 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()
print("No")

Solution (Python):
import sys
stdin = sys.stdin
sys.setrecursionlimit(10**6)
ni = lambda: int(ns())
na = lambda: list(map(int, stdin.readline().split()))
nn = lambda: list(stdin.readline().split())
ns = lambda: stdin.readline().rstrip()

x,y = na()

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

print('No')

Solution (Python):
X, Y = map(int, input().split())
flag = False
for tsuru in range(X+1):
    kame = X - tsuru
    if kame*4 + tsuru*2 == Y:
        flag = True
        break

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 2 * i + 4 * j == Y:
        print("Yes")
        exit()
print("No")

Solution (Python):
import math
import sys
import itertools
from math import gcd
from math import sqrt
from sys import stdin
def input() : return stdin.readline().rstrip()
def mips():
    return map(int,input().split())
def ii():
    return int(input())
sys.setrecursionlimit(10**9)

X,Y = mips()


for t in range(0,100):
    kame = X-t
    if kame < 0:
        break
    if 2 * t + 4 * kame == Y:
        print("Yes")
        sys.exit(0)
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):
a, b = map(int, input().split())
for i in range(101):
  for j in range(101):
    if a == i+j and b== i*2+j*4:
      print("Yes")
      exit()
print("No")

Solution (Python):
import sys
input=sys.stdin.readline
x,y=map(int,input().split())
z=y-2*x
if z%2!=0:
    print('No')
else:
    k=z//2
    t=x-k
    if t>=0 and k>=0:
        print('Yes')
    else:
        print('No')

Solution (Python):
import math


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

Solution (Python):
def main():
    x, y = list(map(int, input().split()))
    for a in range(x + 1):
        b = x - a
        if 2 * a + 4 * b == y:
            print('Yes')
            break
    else:
        print('No')

if __name__ == '__main__':
    main()

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

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

flag = False
for i in range(x + 1):
  kame = i
  turu = x - i
  
  if kame * 4 + turu * 2 == y:
    flag = True
    break
print("Yes" if flag else "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(sample_file = ''):

    """ convenient functions
    
    
    
    
    
    """

    """convenient decorator
    
    
        
        
        
        
        
        
        
        
        
        
    """
    
    
    import sys
    sys.setrecursionlimit(10**7)
    from itertools import accumulate, combinations, permutations, product 
    
    from math import factorial, ceil, floor, sqrt
    def factorize(n):
        """return the factors of the Arg and count of each factor
        
        Args:
            n (long): number to be resolved into factors
        
        Returns:
            list of tuples: factorize(220) returns [(2, 2), (5, 1), (11, 1)]
        """
        fct = []  
        b, e = 2, 0  
        while b * b <= n:
            while n % b == 0:
                n = n // b
                e = e + 1
            if e > 0:
                fct.append((b, e))
            b, e = b + 1, 0
        if n > 1:
            fct.append((n, 1))
        return fct
    def combinations_count(n, r):   
        """Return the number of selecting r pieces of items from n kinds of items.
        
        Args:
            n (long): number
            r (long): number
        
        Raises:
            Exception: not defined when n or r is negative
        
        Returns:
            long: number
        """
        
        if n < 0 or r < 0:
            raise Exception('combinations_count(n, r) not defined when n or r is negative')
        if n - r < r: r = n - r
        if r < 0: return 0
        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 combinations_with_replacement_count(n, r):
        """Return the number of selecting r pieces of items from n kinds of items allowing individual elements to be repeated more than once.
        
        Args:
            n (long): number
            r (long): number
        
        Raises:
            Exception: not defined when n or r is negative
        
        Returns:
            long: number
        """
        if n < 0 or r < 0:
            raise Exception('combinations_with_replacement_count(n, r) not defined when n or r is negative')
        elif n == 0:
            return 1
        else:
            return combinations_count(n + r - 1, r)
    from bisect import bisect_left, bisect_right
    from collections import deque, Counter, defaultdict 
    from heapq import heapify, heappop, heappush, heappushpop, heapreplace,nlargest,nsmallest 
    from copy import deepcopy, copy 
    import operator
    from operator import itemgetter 
    
    
    from functools import reduce, lru_cache
    def chmin(x, y):
        """change minimum
        if x > y, x = y and return (x, True).
        convenient when solving problems of dp[i]
        
        Args:
            x (long): current minimum value
            y (long): potential minimum value
        
        Returns:
            (x, bool): (x, True) when updated, else (x, False)
        """
        if x > y:
            x = y
            return (x, True)
        else:
            return (x, False)
    def chmax(x, y):
        """change maximum
        if x < y, x = y and return (x, True).
        convenient when solving problems of dp[i]
        
        Args:
            x (long): current maximum value
            y (long): potential maximum value
        
        Returns:
            (x, bool): (x, True) when updated, else (x, False)
        """
        if x < y:
            x = y
            return (x, True)
        else:
            return (x, False)

    from fractions import gcd 
    def gcds(numbers):
        return reduce(gcd, numbers)
    def lcm(x, y):
        return (x * y) // gcd(x, y)
    def lcms(numbers):
        return reduce(lcm, numbers, 1)
    def make_divisors(n, reversed=False):
        """create list of divisors
        
        Args:
            number (int): number from which list of divisors is created
            reversed (bool, optional): ascending order if False. Defaults to False.
        
        Returns:
            list: list of divisors
        """
        divisors = set()
        for i in range(1, int(n**0.5)+1):
            if n % i == 0:
                divisors.add(i)
                divisors.add(n//i)
        return sorted(list(divisors),reverse=reversed)
    
    
    
    INF = 10 ** 18
    MOD = 10 ** 9 + 7
    AtoZ = list('abcdefghijklmnopqrsruvwxyz') 
    modpow = lambda a, n, p = MOD: pow(a, n, p) 
    def modinv(a, p = MOD):
        
        
        return modpow(a, p-2, p)
    def modinv_list(n, p = MOD):
        if n <= 1:
            return [0,1][:n+1]
        else:
            inv_t = [0,1]
            for i in range(2, n+1):
                inv_t += [inv_t[p % i] * (p - int(p / i)) % p]
            return inv_t
    def modfactorial_list(n, p = MOD):
        if n == 0:
            return [1]
        else:
            l = [0] * (n+1)
            tmp = 1
            for i in range(1, n+1):
                tmp = tmp * i % p
                l[i] = tmp
            return l
    def modcomb(n, k, fac_list = [], p = MOD):
        
        
        from math import factorial
        if n < 0 or k < 0 or n < k: return 0
        if n == 0 or k == 0: return 1
        if len(fac_list) <= n:
            a = factorial(n) % p
            b = factorial(k) % p
            c = factorial(n-k) % p
        else:
            a = fac_list[n]
            b = fac_list[k]
            c = fac_list[n-k]
        return (a * modpow(b, p-2, p) * modpow(c, p-2, p)) % p
    def modadd(a, b, p = MOD):
        return (a + b) % MOD
    def modsub(a, b, p = MOD):
        return (a - b) % p
    def modmul(a, b, p = MOD):
        return ((a % p) * (b % p)) % p
    def moddiv(a, b, p = MOD):
        return modmul(a, modpow(b, p-2, p))

    class UnionFindTree:
        """union find tree class
        TODO: fix this description...
        how to use (example):
        >>  uf = UnionFindTree(N) 
        >>  if uf.find_root(a) == uf.find_root(b):
        >>      do something
        >>  else:
        >>      do something
        >>      uf.unite(a, b)
        """
        def __init__(self, N):
            self.root = [-1] * (N+1)
            self.rank   = [0]  * (N+1)
            self.connected_num = [1] * (N+1)
    
        def find_root(self,x):
            root = self.root
            while root[x] != -1:
                x = root[x]
            return x
    
        def unite(self,x,y):
            root = self.root
            rank = self.rank
            connected_num = self.connected_num
            find_root = self.find_root
    
            rx = find_root(x)
            ry = find_root(y)
            if rx != ry:
                if rank[rx] < rank[ry]:
                    root[rx] = ry
                    rx,ry = ry,rx
                else:
                    if rank[rx] == rank[ry]:
                        rank[rx] += 1
                    root[ry] = rx       
                connected_num[rx] += connected_num[ry]

    class SegTree:
        """
        ref: https://qiita.com/takayg1/items/c811bd07c21923d7ec69
        init(init_val, ide_ele): 配列init_valで初期化 O(N)
        update(k, x): k番目の値をxに更新 O(logN)
        query(l, r): 区間[l, r)をsegfuncしたものを返す O(logN)
        """
        def __init__(self, init_val, segfunc, ide_ele):
            """
            init_val: 配列の初期値
            segfunc: 区間にしたい操作
            ide_ele: 単位元
            n: 要素数
            num: n以上の最小の2のべき乗
            tree: セグメント木(1-index)
            """
            n = len(init_val)
            self.segfunc = segfunc
            self.ide_ele = ide_ele
            self.num = 1 << (n - 1).bit_length()
            self.tree = [ide_ele] * 2 * self.num
            
            for i in range(n):
                self.tree[self.num + i] = init_val[i]
            
            for i in range(self.num - 1, 0, -1):
                self.tree[i] = self.segfunc(self.tree[2 * i], self.tree[2 * i + 1])

        def update(self, k, x):
            """
            k番目の値をxに更新
            k: index(0-index)
            x: update value
            """
            k += self.num
            self.tree[k] = x
            while k > 1:
                self.tree[k >> 1] = self.segfunc(self.tree[k], self.tree[k ^ 1])
                k >>= 1

        def query(self, l, r):
            """
            [l, r)のsegfuncしたものを得る
            l: index(0-index)
            r: index(0-index)
            """
            res = self.ide_ele
            l += self.num
            r += self.num
            while l < r:
                if l & 1:
                    res = self.segfunc(res, self.tree[l])
                    l += 1
                if r & 1:
                    res = self.segfunc(res, self.tree[r - 1])
                l >>= 1
                r >>= 1
            return res

    
    
    
    
    
    
    
    

    def BellmanFord(N, M, ABC, vertex_start, vertex_end, value_if_inf = -1, find_shortest = False):
        """to calculate furthest or shortest length between vertex_start and vertex_end using BellmanFord algorithm
        
        Args:
            N (int): number of vertices
            M (int): number of edges
            ABC (list): [(ai, bi, ci) for _ in range(N)] where i-th edge is directed from vertex ai to vertex bi and the length is ci 
            vertex_start (int): start vertex. usually use 0.
            vertex_end (int): end vertex. usually use N-1.
            value_if_inf (int or string as you like, optional): value you want when the furthest (or shortest) distance is infinite (or -infinite). Defaults to -1.
            find_shortest (bool, optional): choose False to find furthest path. Defaults to False.
        
        Returns:
            int or string: normally int (but can be str if you set value_if_inf to str)
            
        Example:
                N, M, P = R()
                ABC = [R() for _ in range(M)]
                ABC = [(a-1, b-1, c-P) for a, b, c in ABC]
                print(BellmanFord(N, M, ABC, 0, N-1, value_if_inf = 'inf'))

        """

        def make_reachable_list(N, M, ABC, vertex_start, vertex_end):
            reachable_to_direct = defaultdict(list)
            reachable_from_direct = defaultdict(list)
            reachable_from_start = [False] * N
            reachable_to_end = [False] * N
            reachable_from_start[vertex_start] = True
            reachable_to_end[vertex_end] = True
            reachable_from_both_sides = [False] * N
            dfs_from_start = []
            dfs_to_end = []
            for a, b, c in ABC:
                reachable_to_direct[a].append(b)
                reachable_from_direct[b].append(a)
                if a == vertex_start:
                    dfs_from_start.append(b)
                    reachable_from_start[b] = True
                if b == vertex_end:
                    dfs_to_end.append(a)
                    reachable_to_end[a] = True
            while dfs_from_start:
                v = dfs_from_start.pop()
                for i in reachable_to_direct[v]:
                    if not reachable_from_start[i]:
                        reachable_from_start[i] = True
                        dfs_from_start.append(i)
            while dfs_to_end:
                v = dfs_to_end.pop()
                for i in reachable_from_direct[v]:
                    if not reachable_to_end[i]:
                        reachable_to_end[i] = True
                        dfs_to_end.append(i)
            for i in range(N):
                reachable_from_both_sides[i] = reachable_from_start[i] and reachable_to_end[i]
            return reachable_from_both_sides
        
        reachable_from_both_sides = make_reachable_list(N, M, ABC, vertex_start, vertex_end)
        
        if find_shortest:
            dist = [INF for i in range(N)]
        else:
            dist = [-INF for i in range(N)]
        
        dist[vertex_start] = 0
        for i in range(N):
            updated = False
            for a, b, c in ABC:
                if not reachable_from_both_sides[a]:
                    continue
                elif find_shortest:
                    update_condition = dist[a] + c < dist[b]
                else:
                    update_condition = dist[a] + c > dist[b]
                if dist[a] != INF and update_condition:
                    dist[b] = dist[a] + c
                    updated = True
                    if i == N-1:
                        return value_if_inf
            if not updated:
                break
        return dist[vertex_end]

    
    def warshall_floyd(number_vertex, XYD, shift_one_for_vertex=False):
        
        
        
        
        
        d = [[float("inf")]*number_vertex for i in range(number_vertex)]
        for x, y, dist in XYD:
            if shift_one_for_vertex:
                x = x - 1
                y = y - 1
            d[x][y] = dist
            d[y][x] = dist
        for i in range(number_vertex):
            d[i][i] = 0 
        for k in range(number_vertex):
            for i in range(number_vertex):
                for j in range(number_vertex):
                    d[i][j] = min(d[i][j],d[i][k] + d[k][j])
        return d


    """ initialize variables and set inputs
    
        
        
            
            
    
        
        
        
        
        
        
        
    
        
        
        
        
    
        
        
    """

    
    r = lambda: sys.stdin.readline().strip()
    r_int = lambda: int(r())
    r_float = lambda: float(r())
    R = lambda: list(map(int, r().split()))
    R_str = lambda: r().split()
    R_map = lambda: map(int, r().split())
    R_float = lambda: list(map(float, r().split()))
    R_tuple = lambda: tuple(map(int, r().split()))

    """ how to treat input
    
    
    
    
    
    
    
    """

    
    if sample_file:
        sys.stdin = open(sample_file)
        
    
    
    
    X, Y = R()
    if X * 2 <= Y <= X * 4 and Y%2 == 0:
        print('Yes')
    else:
        print('No')
    
    
    
    

    """memo: how to use defaultdict of list
    
    Dic = defaultdict(list)
    
    Dic[x].append(y)
    
    for k, v in Dic.items():
    """
    
    """memo: how to solve binary problems
    
    >>> a = 5
    >>> bin_str_a = format(a, '
    >>> print(bin_str_a)
    0b0101 
    """
    
    """memo: how to solve the problem
    creating simple test/answer
    greed
    simple dp
    graph
    """

if __name__ == '__main__':
    main()

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

'''

'''

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
import sys

X, Y = [int(x) for x in stdin.readline().rstrip().split()]
for i in range(0,X+1):
    if i*2+(X-i)*4==Y:
        print('Yes')
        sys.exit()
print('No')

Solution (Python):
import sys
sys.setrecursionlimit(10000000)
MOD = 10 ** 9 + 7
INF = 10 ** 15

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

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

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

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

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

Solution (Python):
from functools import reduce
from fractions import gcd
import math
import bisect
import itertools
import sys
sys.setrecursionlimit(10**7)
input = sys.stdin.readline
INF = float("inf")



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

    ans = "No"
    for a in range(X+1):
        for b in range(X+1):
            if a + b == X and a*2 + b*4 == Y:
                ans = "Yes"
    
    print(ans)


if __name__ == '__main__':
    main()

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

for turu in range(x+1):
  kame = x - turu
  if turu*2 + kame*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):



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

    for n_turu in range(X+1):
        n_kame = X - n_turu
        if n_turu * 2 + n_kame * 4 == Y:
            return "Yes"

    return "No"


print(main())

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


if __name__ == "__main__":
    main()

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

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

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

Solution (Python):
i = input().split()
i = [int(j) for j in i]
 
flg = 0
for a in range(i[0]+1):
  if 2*a+4*(i[0]-a)==i[1]:
    print("Yes")
    flg = 1
    
if flg==0:
  print("No")

Solution (Python):
import sys

sys.setrecursionlimit(1000000)

import bisect
import math
import collections
import heapq


def solve(X, Y):
    for k in range(X + 1):
        t = X - k
        if Y == (k * 4) + (t * 2):
            return "Yes"
    return "No"


if __name__ == "__main__":
    X, Y = tuple(map(int, input().split(" ")))
    print(solve(X, Y))

Solution (Python):
def get_ints():
    return list(map(int, input().split()))

x, y = get_ints()
ok = False
for i in range(x + 1):
    ok |= 4 * i + 2 * (x - i) == y

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

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

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

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

    for turu in range(X+1):
        kame = X-turu
        if turu*2 + kame *4 == Y:
            print("Yes")
            return
    else:
        print("No")
resolve()

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

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

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

Solution (Python):

import sys

YES = "Yes"  
NO = "No"  


def solve(X: int, Y: int):
    n = (Y - 2*X) / 2
    if (int(n) == n) and (0<=n<=X):
        print(YES)
    else:
        print(NO)
    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):
import math,itertools,fractions,heapq,collections,bisect,sys,queue,copy

sys.setrecursionlimit(10**7)
inf=10**20
mod=10**9+7
dd=[(-1,0),(0,1),(1,0),(0,-1)]
ddn=[(-1,0),(-1,1),(0,1),(1,1),(1,0),(1,-1),(0,-1),(-1,-1)]

def LI(): return [int(x) for x in sys.stdin.readline().split()]

def I(): return int(sys.stdin.readline())
def F(): return float(sys.stdin.readline())
def LS(): return sys.stdin.readline().split()
def S(): return input()

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

  for i in range(x+1):
    j=x-i
    z=i*2+j*4

    if z==y:
      return 'Yes'

  return 'No'


print(main())

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

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

def Z(): return int(input())
def ZZ(): return [int(_) for _ in input().split()]

def main():
    X, Y = ZZ()
    for n in range(101):
        for m in range(101):
            if n+m == X and 2*n+4*m == Y:
                print('Yes')
                break
        else: continue
        break
    else: print('No')

    return

if __name__ == '__main__':
    main()

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

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):
import sys
from functools import lru_cache, cmp_to_key
from heapq import merge, heapify, heappop, heappush
from math import *
from collections import defaultdict as dd, deque, Counter as C
from itertools import combinations as comb, permutations as perm
from bisect import bisect_left as bl, bisect_right as br, bisect
from time import perf_counter
from fractions import Fraction

sys.setrecursionlimit(int(pow(10,6)))


mod = int(pow(10, 9) + 7)
mod2 = 998244353
def data(): return sys.stdin.readline().strip()
def out(*var, end="\n"): sys.stdout.write(' '.join(map(str, var))+end)
def l(): return list(sp())
def sl(): return list(ssp())
def sp(): return map(int, data().split())
def ssp(): return map(str, data().split())
def l1d(n, val=0): return [val for i in range(n)]
def l2d(n, m, val=0): return [l1d(n, val) for j in range(m)]



x,y=l()
for a in range(1000):
    for b in range(1000):
        if a+b==x and 2*a+4*b==y:
            print("Yes")
            exit()
print("No")
exit()

Solution (Python):
n,m=map(int,input().split())

if n*2<=m and m<=n*4 and m%2==0:
    print("Yes")
    exit()


print("No")

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

if y % 2 == 1:
    print("No")
elif x * 2 <= y <= x * 4:
    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")