Beautiful Strings

Given a string S, determine if it is "beautiful". A string is defined to be beautiful if it satisfies the following conditions:

• Every vowel, i.e. \(\{a, e, i, o, u\}\), appears at least once in S.
• No two consecutive characters in S are identical.

For example, the string "aeioubcdef" is beautiful, while "hello" is not.

inputFormat

The input begins with an integer T, representing the number of test cases. Each of the following T lines contains a single string S.

\(1 \leq T \leq 100\)

outputFormat

For each test case, output a single line containing "YES" if the string is beautiful, otherwise output "NO".

## sample

4
aeioubcdef
hello
beautiful
aeiooeieee

YES
NO
NO
NO

</p>