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
def check(s):
    if len(s)<26:
        return 'No'
    l=[s.count(i) for i in set(s)]
    c=s.count('a')
    if c*len(set(s))==sum(l):
        return 'Yes'
    return 'No'
    
    
for _ in xrange(input()):
    s=raw_input()
    print(check(s))