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
alpha = "abcdefghijklmnopqrstuvwxyz"

test = input()
for i in xrange(test):
	word = raw_input()
	d = {}
	for i in word:
		if i in d:
			d[i] += 1
		else:
			d[i] = 1
	
	#print d
	final = ''.join(sorted(d.keys()))
	#print final
	final1 = len(set(d.values()))
	
	if final == alpha and final1 == 1:
		print "Yes"
	else:
		print "No"