Balance strings, by definition, are the strings that contain all the characters of the alphabet, from a to z, equal no of times.
eg- abcdefghijklmnopqrstuvwxyz is a balanced string, aabb is not.

Input:
First line contains number of test cases T. Each test case contains a string S which made up of only lowercase characters.  

Output:
For each test case print Yes if the string is balanced string else print No.  

Constraints: 
1 ≤ T ≤ 10
1 ≤ |S| ≤ 1000   

SAMPLE INPUT
2
codemyca
abcdefghijklmnopqrstuvwxyz

SAMPLE OUTPUT
No
Yes
import string
t=input()
for _ in range(t):
	stri=raw_input()
	k=stri.count('a')
	if k==0:
		print "No"
	else:
		chk=True
		for ch in string.ascii_lowercase:
			if stri.count(ch)!=k:
				chk=False
				break
		if chk:
			print "Yes"
		else:
			print "No"