A pangram is a sentence that uses every letter of the alphabet at least once. For example, "the quick brown fox jumps over a lazy dog" and "jackdaws love my big sphinx of quartz" are pangrams. Given a sentence, write a program that determines whether it is a pangram.
The input consists of several test cases. Each test case is given on its own line and is a sentence of at most 200 characters. Words are separated by a single space, and every word consists only of lowercase English letters. The last line of the input contains a single asterisk (*), which is not part of the test cases.
For each test case, print Y on its own line if the given sentence is a pangram, or N otherwise.