|Peter has problems with pronouncing difficult words. In particular he can't pronounce words that contain three or more consecutive consonants (such as "street" or "first"). Furthermore he can't pronounce words that contain two or more consecutive vowels that are different (such as "goal" or "beauty"). He can pronounce words with two consecutive equal vowels though (such as "need").
Is this problem we consider the 'y' to be always a consonant, even in words like "any". So the vowels are 'a', 'e', 'i', 'o' and 'u'. You are given a String words. If Peter can pronounce all the words, return an empty String; otherwise return the first word he can't pronounce.
|-||words contains between 1 and 50 elements, inclusive.|
|-||Each element of words has length between 1 and 50, inclusive.|
|-||Each element of words consists of upper- and lowercase letters.|