Taco Tree Combination Problem

In this problem, you are given two integers (Z) and (W) representing the total number of trees and their combined height respectively. There are two types of trees available: tall trees with height 5 and short trees with height 3. Your task is to determine whether there exists a combination of tall and short trees such that the total number of trees is exactly (Z) and the total height sums up to (W).

You need to output Yes if such a combination exists, and No otherwise.

inputFormat

The input consists of a single line containing two integers (Z) and (W) separated by a space, where (Z) is the total number of trees, and (W) is the total combined height of the trees.

outputFormat

Output a single line containing Yes if there exists a valid combination of trees, otherwise output No.## sample

4 16

Yes