Warning: Only Brainf**k language is allowed.

After I solve this problem in 0.00s using BF , I have an idea to set new BF problems, now here I come

The task is simple, given a <string>(1≤"length of string"≤10) just check if the string is palindrome or not.

The string contains character in range ASCII(97)≤char≤ASCII(122) (lower case alphabet)

Input

The first line, there is an integer T(1≤T≤100) denoting number of test cases then you should process only next T lines, each line is a <string> terminated by new line character ('\n') ASCII(10)

Output

For each test case:

if <string> is palindrome, output: YES

else, output: NO

Example

Input:

2

aba

ab

Output:

YES

NO

Score

Score is length of your source.

If you TLE here, you may try this problem first. If you got AC in 0.00s there you shoud got AC in 0.00s here too

See also: Another problem added by Tjandra Satria Gunawan