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=input()
while t:
	t-=1
	s=raw_input()
	a=[0]*27
	for x in s:
		tt = ord(x)-96
		a[tt]+=1

	pp = a[1]
	bb = 1
	for x in a[1:]:
		if not x == pp:
			bb=0	
			break
	if bb == 1:
		print("Yes")
	else:
		print("No")