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 in Go (1.14.1) (judge verdict: Wrong Answer)

package main

import (
	"fmt"
	"os"
)

const turtle = 4
const crane = 2

func main() {

	var x, y int

	fmt.Scan(&x, &y)

	if y%2 == 1 {
		fmt.Println("No")
		os.Exit(0)
	}

	i := calc(x, y)
	if i > 0 {
		fmt.Println("yes")
	} else {
		fmt.Println("No")
	}

}
func calc(x, y int) int {

	if y < 0 {
		return 0
	}
	if x == 0 && y != 0 {
		return 0
	}
	if x != 0 && y == 0 {
		return 0
	}
	if x == 0 && y == 0 {
		return 1
	}
	return (calc(x-1, y-crane) + calc(x-1, y-turtle))
}