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
t=input()
for x in range(0,t):
    a=raw_input()
    a=list(a)
    lis=[]
    for x in range(0,26):
        lis.append(0)
    for x in a:
        i=ord(x)-ord('a')
        lis[i]=lis[i]+1
    test=lis[0]
    flag=0
    for x in lis:
        if x!=test:
            print("No")
            flag=1
            break
    if flag==0:
        print("Yes")