A palindrome is a string that reads the same in both directions, for example z, uwu, or moom.

Input

The first line contains an integer $t$ ($1 \leq t \leq 100$) — the number of testcases.

The following $t$ lines each contain a string of length at most $100$ consisting of lowercase English letters.

Output

For each test case, output "YES" or "NO", denoting the answer.

见题面 Input 部分

见题面 Output 部分