Problem: A string is said to be "SUPER STRING" if the number of times the character appeared in the string is equal to its ASCII value. Given the conditions that the ASCII value of ‘a’ is 26 and z is ‘1’.

Input 

First line takes number of test cases ‘N’.
Following ‘N’ lines take string as input.

Output

‘Yes’ if the string is a super String
‘No’ if string is not a Super String

SAMPLE INPUT
2
ZYY
ZYYZ

SAMPLE OUTPUT
Yes
No

Explanation

'Z' appeared once and 'Y' appeared twice in the first test case so it was a 'Yes' and in second test case 'Z' appeared twice therefore it was a 'No'

Solution (in PYTHON):

Solution:
l=[i for i in range(26,0,-1)]
c="ABCDEFGHIJKLMNOPQRSTUVWXYZ"
#print l
for _ in xrange(input()):
	chk=True
	s=raw_input()
	for ch in c:
		if ch in s:
			a=s.count(ch)
			b=ord(ch)-ord('A')
			#print a,b,l[b]
			if a!=l[b]:
				chk=False
				break
	if chk:
		print "Yes"
	else:
		print "No"