Problem Description

The official name of Tokyo Institute of Technology is Tokyo Institute of Technology, and its official abbreviation is Tokyo Tech. Rina, a student at Tokyo Institute of Technology, wants to filter the AtCoder contest leaderboard to include only those who are affiliated with Tokyo Institute of Technology. However, the affiliation string varies; some use the full name, some use the abbreviation, and there are minor variations in spelling. Therefore, Rina decided to use the pattern *okyo*ech* for filtering. Rina is busy preparing for TTPC2200, so she asked you, a passerby, to create the filtering program.

You are given an integer $ N $. Following this, $ N $ lines are given, where the $ i $-th line contains a string $ S_i $ representing the affiliation. Output Yes if the affiliation matches the *okyo*ech* pattern, otherwise output No.

A string T is said to match the *okyo*ech* pattern if there exist strings A, B, and C such that T can be written as A + "okyo" + B + "ech" + C. Here, + denotes string concatenation, and A, B, and C can potentially be empty strings.

Input Format

The input is given from the standard input in the following format:

$ N $ $ S_1 $ $\vdots$ $ S_N $

Output Format

Output the answer for each $ S_i $ on a new line.

Sample Input and Output

Sample Input #1

1
tokyoinstituteoftechnology

Sample Output #1

Yes

Sample Input #2

8
okyoech
tokyotech
titech
tokyotokyotechtech
tokyotecg
tttoookkkyyyooottteeeccchhh
tokyokogyodaigaku
tokyouniversityofagricultureandtechnology

Sample Output #2

Yes
Yes
No
Yes
No
No
No
Yes

Notes/Hints

Constraints

• $ N $ is an integer satisfying $1 \leq N \leq 50$
• $ S_i $ is a string consisting only of lowercase English letters
• $1 \leq \lvert S_i \rvert \leq 50$

Sample Explanation 2

• Note that the answer can be Yes for universities or other institutions that are not Tokyo Institute of Technology.

见题面 Input 部分

见题面 Output 部分