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
counter=0
a=[]
count=raw_input("")
counts=int(count)
if((counts>0) and (counts)<=10):
    while(counts!=counter):
        string=raw_input("")
        if((len(string)<=1000) and (len(string)>0)):
            for char in string:
                a.append(char)
            if('a' not in a):
                print "No"
            elif('b' not in a):
                print "No"
            elif('c' not in a):
                print "No"
            elif('d' not in a):
                print "No"
            elif('e' not in a):
                print "No"
            elif('f' not in a):
                print "No"
            elif('g' not in a):
                print "No"
            elif('h' not in a):
                print "No"
            elif('i' not in a):
                print "No"
            elif('j' not in a):
                print "No"
            elif('k' not in a):
                print "No"
            elif('l' not in a):
                print "No"
            elif('m' not in a):
                print "No"
            elif('n' not in a):
                print "No"
            elif('o' not in a):
                print "No"
            elif('p' not in a):
                print "No"
            elif('q' not in a):
                print "No"
            elif('r' not in a):
                print "No"
            elif('s' not in a):
                print "No"
            elif('t' not in a):
                print "No"
            elif('u' not in a):
                print "No"
            elif('v' not in a):
                print "No"
            elif('w' not in a):
                print "No"
            elif('x' not in a):
                print "No"
            elif('y' not in a):
                print "No"
            elif('z' not in a):
                print "No"
            else:
                count_a=a.count('a')
                count_b=a.count('b')
                count_c=a.count('c')
                count_d=a.count('d')
                count_e=a.count('e')
                count_f=a.count('f')
                count_g=a.count('g')
                count_h=a.count('h')
                count_i=a.count('i')
                count_j=a.count('j')
                count_k=a.count('k')
                count_l=a.count('l')
                count_m=a.count('m')
                count_n=a.count('n')
                count_o=a.count('o')
                count_p=a.count('p')
                count_q=a.count('q')
                count_r=a.count('r')
                count_s=a.count('s')
                count_t=a.count('t')
                count_u=a.count('u')
                count_v=a.count('v')
                count_w=a.count('w')
                count_x=a.count('x')
                count_y=a.count('y')
                count_z=a.count('z')
                if(count_a==count_b==count_c==count_d==count_e==count_f==count_g==count_h==count_i==count_j==count_k==count_l==count_m==count_n==count_o==count_p==count_q==count_r==count_s==count_t==count_u==count_v==count_w==count_x==count_y==count_z):
                    print "Yes"
                else:
                    print "No"
            del a[:]
            counter+=1