#abc105b. [abc105_b]Cakes and Donuts
[abc105_b]Cakes and Donuts
Problem Statement
La Confiserie d'ABC sells cakes at dollars each and doughnuts at dollars each. Determine if there is a way to buy some of them for exactly dollars. You can buy two or more doughnuts and two or more cakes, and you can also choose to buy zero doughnuts or zero cakes.
Constraints
- is an integer between and , inclusive.
Input
Input is given from Standard Input in the following format:
Output
If there is a way to buy some cakes and some doughnuts for exactly dollars, print Yes
; otherwise, print No
.
Sample Input 1
11
Sample Output 1
Yes
If you buy one cake and one doughnut, the total will be dollars.
Sample Input 2
40
Sample Output 2
Yes
If you buy ten cakes, the total will be dollars.
Sample Input 3
3
Sample Output 3
No
The prices of cakes ( dollars) and doughnuts ( dollars) are both higher than dollars, so there is no such way.