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 string import lowercase as lc
t=int(raw_input())
for qq in xrange(t):
	d={}
	for x in lc:
		d[x]=0
	s=raw_input()
	for x in s:
		d[x]+=1
	val=d['a']
	ok=True
	for x in lc:
		tmp = d[x]
		if tmp != val:
			ok=False
			break
	if ok:
		print 'Yes'
	else:
		print 'No'