I. Mountain Climbertime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputInputThe 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.ExampleInput
23bigflashingclumpiunderpasspassundertranquilizingpoleandrejdumplingbocchiryonijikakitasingingsongsalperentoxicpiearibucketpotatoflamestormscarletsmaisakurajimamisakamikotoninfiasylveonpikachumewheniseearulhiiarulOutput
YES
NO
YES
YES
YES
NO
YES
NO
YES
YES
YES
YES
YES
YES
NO
NO
NO
YES
NO
NO
NO
NO
NO
 
23bigflashingclumpiunderpasspassundertranquilizingpoleandrejdumplingbocchiryonijikakitasingingsongsalperentoxicpiearibucketpotatoflamestormscarletsmaisakurajimamisakamikotoninfiasylveonpikachumewheniseearulhiiarul
YES NO YES YES YES NO YES NO YES YES YES YES YES YES NO NO NO YES NO NO NO NO NO 
['*special problem']