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
for _ in xrange(input()):
	string = raw_input();
	count = {}
	for ele in string:
		if count.has_key(ele):
			count[ele] += 1;
		else:
			count[ele] = 1;
	
	keys = count.keys();
	if len(keys) != 26:
		print "No";
	else:
		init = count[keys[0]];
		flag = 0;
		for key in keys:
			if count[key] != init:
				print "No";
				flag = 1;
				break;
			
		if flag == 0:
			print "Yes";