Opposite Words

No attempts yetTime limit1sMemory limit256 MB

Problem

Two letters are opposite in the alphabet when they sit the same distance from the ends, such as A and Z or B and Y. A word is an opposite word if every alphabetic character can be paired with its opposite partner. Letter case does not matter, and non-letter symbols such as hyphens are ignored.

Input

The first line contains the number of test cases nn. Each of the next nn lines contains one word.

Output

For each word, print Yes if it is an opposite word and No otherwise, one per line.

Constraints

  • 1n1 \leq n
  • Each word has length from 11 to 1515