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
from collections import defaultdict
t=input()
for j in range(t):
	s=raw_input()
	d=defaultdict(int)
	count=0
	for i in s:
		d[i]+=1
	if len(d)==26:
		count=d[s[0]]
		for i in d:
			if d[i]!=count:
				count=0
				break
	if count==0:
		print "No"
	else:
		print "Yes"