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(int(input())):
    s=raw_input()
    danger=0
    d=set(s)
    c=set('abcdefghijklmnopqrstuvwxyz')
    new=list(c)
    new.sort()
    p=s.count('a')
    if c.issubset(d):
        for i in new:
            if s.count(i)==p:
                danger+=1
    print ("Yes" if(danger)==26 else "No")