310310: CF1812I. Mountain Climber
Memory Limit：256 MB
Time Limit：1 S
Judge Style：Text Compare
Creator：
Submit：0
Solved：0
Description
I. Mountain Climbertime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputInput
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.
OutputFor each test case, print YES or NO.
ExampleInput23 big flashing clump i underpass passunder tranquilizing pole andrej dumpling bocchiryonijikakitasingingsongs alperen toxicpie ari bucketpotato flamestorm scarlets maisakurajima misakamikoto ninfia sylveon pikachu mewheniseearulhiiarulOutput
YES NO YES YES YES NO YES NO YES YES YES YES YES YES NO NO NO YES NO NO NO NO NO