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 collections import Counter
i=0
N=input()
while i<N:
	st=raw_input()
	d=Counter([j for j in st])
	if len(d)==26 and len(set(d.values()))==1:
		print 'Yes'
	else:
		print 'No'
	i+=1