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(input())
for tcase in range(t):
	x=raw_input()
	dic={}
	a='abcefghijklmnopqrstuvwxyz'
	lis=[]
	lis=list(a)
	for i in lis:
		if i in dic:
			dic[i]=0
		else:
			dic[i]=0
	lis=list(x)
	for i in x:
		if i in dic:
			dic[i]+=1
	lis1=[]
	lis1=list(dic.values())
	flag=1
	for i in range(len(lis1)-1):
		if(lis1[i]!=lis1[i+1]):
			flag=0
	if(flag==1):
		print("Yes")
	else:
		print("No")