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 i in range(int(input())):
    st=raw_input()
    if len(st)<26:
        print("No");
    else:
        s=set(st)
        if len(s)<26:
            print("No");
        else:
            li=list(st)
            li.sort()
            l=len(li)//26
            for j in range(26):
                if li[l*j]==li[l*(j+1)-1]:
                    if j==25:
                        print("Yes");
                    continue
                else:
                    print("No");
                    break