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(0,t):
	n=list(raw_input())
	l=[0]*26
	for k in range(0,len(n)):
		l[ord(n[k])-ord('a')]=l[ord(n[k])-ord('a')]+1
	cnt=l[0]
	flg=0
	for m in range(0,26):
		if(l[m]!=cnt):
			flg=1
			break
	if(flg==1):
		print "No"
	else:
		print "Yes"