문제<\/h2>
There are many ways to write a word on paper. For example, some writing systems, like Arabic and Hebrew, omit most vowels, although they write some of them.<\/p>
In this problem, we will only consider strings consisting of English letters and hyphens. Letters '`a<\/code>', 'e<\/code>', 'i<\/code>', 'o<\/code>', 'u<\/code>', and 'y<\/code>' are considered to be vowels, while hyphens and all other letters are considered to be consonants. All comparisons are case-insensitive: uppercase and lowercase versions of the same letter are considered equal.<\/p>`
You are given two strings $s<\/mi><\/mrow>s<\/math><\/span><\/span> s<\/span><\/span><\/span><\/span> and f<\/mi><\/mrow>f<\/math><\/span><\/span> f<\/span><\/span><\/span><\/span>, called the short<\/em> name and the full<\/em> name, respectively. Your task is to check whether the short name s<\/mi><\/mrow>s<\/math><\/span><\/span> s<\/span><\/span><\/span><\/span> can be obtained from the full name f<\/mi><\/mrow>f<\/math><\/span><\/span> f<\/span><\/span><\/span><\/span> by omitting some vowels (possibly none).<\/p> 입력<\/h2> The first line contains a single string s<\/mi><\/mrow>s<\/math><\/span><\/span> s<\/span><\/span><\/span><\/span>, denoting the short name.<\/p> The second line contains a single string$

Missing Vowels