Given a string, determine if it can be represented as the concatenation of several centrally symmetric substrings.

Formally, a string is centrally symmetric if and only if it satisfies one of the following conditions:

•   is an empty string.
•  , i.e., is one of the four letters: o, s, x and z.
•  , i.e., starts and ends with a pair of centrally symmetric letters, and the middle part is also a centrally symmetric substring.

A string is considered good if and only if there exists an integer such that , where () is a centrally symmetric substring.

Given a string , determine whether it is a good string.

输入描述:

The input contains multiple test cases.

The first line contains an integer , indicating the number of test cases.

The following  lines each contain a string  () consisting of lowercase English letters, representing the string to be tested.

It is guaranteed that , where  represents the length of string .

输出描述:

For each test case, if the string is good, output “Yes”; otherwise, output “No”.

You can output each letter in any case (lowercase or uppercase). For example, the strings “yEs”, “yes”, “Yes”, and “YES” will be accepted as a positive answer.

3
sosos
hahaha
sbzzq

Yes
No
Yes

For the third test case, the string can be divided into two substrings, “s” and “bzzq”, both of which are centrally symmetric substrings. Therefore, the output is “Yes”.