Mountain Climber
Description
The first line of input contains $t$ ($1 \leq t \leq 25$) — the number of test cases.
The only line of each test case contains a single string $s$ ($1 \leq |s| \leq 100$) consisting only of lowercase English letters.
For each test case, print YES or NO.
Input
The first line of input contains $t$ ($1 \leq t \leq 25$) — the number of test cases.
The only line of each test case contains a single string $s$ ($1 \leq |s| \leq 100$) consisting only of lowercase English letters.
Output
For each test case, print YES or NO.
23
big
flashing
clump
i
underpass
passunder
tranquilizing
pole
andrej
dumpling
bocchiryonijikakitasingingsongs
alperen
toxicpie
ari
bucketpotato
flamestorm
scarlets
maisakurajima
misakamikoto
ninfia
sylveon
pikachu
mewheniseearulhiiarul
YES
NO
YES
YES
YES
NO
YES
NO
YES
YES
YES
YES
YES
YES
NO
NO
NO
YES
NO
NO
NO
NO
NO