Company: visa_14dec
Difficulty: easy
Reverse Substring for Vowel-Bounded Words A text-analyzing tool makes one small adjustment to the words of a document. A word is vowel-bounded when its first character and its last character are both vowels. The vowels are exactly a , e , i , o , u , in either uppercase or lowercase — so A , E , I , O , U count as well, and no other letter ever does. Every vowel-bounded word is rewritten: the characters lying strictly between the first and the last character are reversed, while the first and the last character stay exactly where they are, with their original case. Every other word is left untouched, and all words keep their original positions. Given the words of the document in order, print the document after this rewriting. Input Format The first line contains a single integer n — the number of words. Each of the next n lines contains one word, consisting of English letters only. Output Format Print n lines: the i -th line is the i -th word after the rewriting described above. When n