$Alien$ likes to give challenges to $Codezen$ team to check their implementation ability, this time he has given a string $S$ and asked to find out whether the given string is a $GOOD$ string or not.
According to the challenge $GOOD$ String is a string that has at least $3$ consecutive vowels and at least $5$ different consonants.
For example $ACQUAINTANCES$ is a $ GOOD $String ,as it contains $3$ consecutive vowels $UAI$ and $5$ different consonants $ {C, Q, N, T, S} $
but $ACQUAINT $ is not ,as it contain $3$ vowels but have only $ 4$ different consonants
${C, Q, N, T}$.

-----Input:-----
A string input is given from Standard Input that consists of only capital letters.

-----Output:-----
Output a single line that is either $GOOD$ (if string is a good string ) or [MATH18].

-----Constraints-----
- $8 \leq S \leq 1000$

-----Sample Input 1:-----
AMBITIOUSNESS

-----Sample Output 2:-----
GOOD

-----Sample Input 2:-----
COOEY

-----Sample Output 2:-----
-1

见题面

见题面