Created by : PCLP
Alchemy is a discipline that is believed to span at least 2500 years of human history. It is most known for its intention of transforming matter, typically trying to come up with a recipe to make gold based on much less valued metals, aided by some non-metal components.
Most scientists and scholars think that alchemy has failed. They surely do not know that a particular alchemist named Albert Ainstain, managed to create gold from a simple combination of ordinary iron (much more common and cheap than gold) and some good-old-fashioned water. However, the combination must have the exact proportion of grams of iron and centiliters of water to work, otherwise the alchemist would end up with useless rusty iron.
Many alchemists and bussinessman had tried to recreate Albert Ainstain’s findings to achieve recognition, fame, prestige or economical welfare, but none of them have suceeded. Since you know very little about chemistry, alchemy and ancient practices, you believe that your chances for success in this task are bounded to using a computer in your benefit.
Therefore, you decide to create a program that automatically tests a given combination of iron and water, and informs whether that combination has the correct proportion to produce gold. Of course, once you find the right proportion, you can double both amounts and get double the gold, cut both in half and get half the gold, or multiply both by any other real number to obtain the amount of gold you want.
Your task is then, given the number of grams of iron and the number of centiliters of water, say whether the proportion between both components is the right one.
The input contains several test cases, each one described in a single line. The line contains two integers I and W separated by a single space, representing grams of iron and centiliters of water, respectively (1 ≤ I, W ≤ 106 ). The last line of the input contains the number −1 twice separated by a single space and should not be processed as a test case.
For each test case output a single line containing an uppercase “Y” if the combination produces gold, or an uppercase “N” otherwise.
Input: 1000 37 999 37 10000 370 10001 370 -1 -1 Output: Y N Y N
Runtime Limit : 1 seconds Memory Limit : 10000 bytes