Professor Sh. is engaged in fundamental research in the field of string studies. So, recently at a scientific conference in Byrnix, the professor stunned the scientific community with a discovery of a new type of strings – good strings. A non-empty string $$$S$$$ consisting of uppercase Latin letters is called good if it does not have $$$k$$$ consecutive vowels or $$$k$$$ consecutive consonant letters. Now Professor Sh. wants to look for its longest good substring in each string. However, the professor is good at theoretical constructions, and writing programs is his weak point. The professor needs your help. Write a program that, for a given string, will search for its longest good substring. It should be assumed that the vowel letters in the Latin alphabet are the letters $$$a$$$, $$$e$$$, $$$i$$$, $$$o$$$, $$$u$$$.