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
import string
t = input()
for i in range(t):
    x = raw_input()
    hist = {}
    for letter in string.lowercase:
        hist[letter]=0
    for letter in x:
        hist[letter]+=1
    freqa = hist['a']
    b=True
    for letter in hist:
        if letter == 'a':continue
        if hist[letter]!=freqa:
            print "No"
            b=False
            break
    if b:print "Yes"