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
for i in range(input()):
	alpha=[0 for j in range(26)]	
	s=raw_input()
	for j in range(len(s)):
		alpha[ord(s[j])-97]+=1
	flag=0
	for j in range(1,len(alpha)):
		if(alpha[j-1]!=alpha[j]):
			print "No"
			flag=1
			break
	if flag==0:
		print "Yes"