Question
Reach Codetown
Prathmesh embarks on a journey starting from a town named S, containing a string of 8 uppercase English alphabets. His objective is to reach the destination known as CODETOWN
.
If Prathmesh is currently in town T1, then, with each move, Prathmesh can transition to another town named T2, provided that either:
- T2 is derived from T1 by replacing a consonant with another consonant, or;
- T2 is derived from T1 by replacing a vowel with another vowel.
Find whether Prathmesh can reach CODETOWN
in any number of moves.
Note that in the english alphabet, letters A
, E
, I
, O
, and U
are considered as vowels and rest are considered as consonants.
Input
The first line of input will contain a single integer T, denoting the number of test cases.
Each test case consists of a string S, of length 8 consisting of uppercase english alphabets.
Constraints
1 ≤ T ≤ 104
|S| = 8
S consists of uppercase english alphabets.
Each test case consists of a string S, of length 8 consisting of uppercase english alphabets.
Constraints
1 ≤ T ≤ 104
|S| = 8
S consists of uppercase english alphabets.
Output
For each test case, output on a new line, Yes, if Prathmesh can reach CODETOWN, and No otherwise.
Example
Input
2
YAPETOWN
CODETOWN
Output
Yes
No
Explanation
Test case 1: Prathmesh can reach to CODETOWN in the following way: YAPETOWN → CAPETOWN → COPETOWN → CODETOWN.
Test case 2: Prathmesh is already in CODETOWN.
2
YAPETOWN
CODETOWN
Output
Yes
No
Explanation
Test case 1: Prathmesh can reach to CODETOWN in the following way: YAPETOWN → CAPETOWN → COPETOWN → CODETOWN.
Test case 2: Prathmesh is already in CODETOWN.