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
t = int(raw_input())
for i in range(t):
	result = 'Yes'
	input = list(raw_input())
	if len(input)%26 != 0:
		result = 'No'
	if result == 'Yes':
		if input.count('a') == input.count('b') == input.count('c') == input.count('d') == input.count('e') == input.count('f') == input.count('g') == input.count('h') == input.count('i') == input.count('j') == input.count('k') == input.count('l') == input.count('m') == input.count('n') == input.count('o') == input.count('p') == input.count('q') == input.count('r') == input.count('s') == input.count('t') == input.count('u') == input.count('v') == input.count('w') == input.count('x') == input.count('y') == input.count('z'):
			print 'Yes'
			continue
	print 'No'