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 isBalancedString(string):
    sorted_str = sorted(string)
    last_count = 0
    before_last_count = 0
    prev_char = ''
    unique_chars = 0
    for s in sorted_str:
        if prev_char != s:
            unique_chars = unique_chars + 1
            if before_last_count > 0 and last_count != before_last_count:
                return False
            before_last_count = last_count
            last_count = 0
        last_count = last_count + 1
        prev_char = s

    return last_count == before_last_count and unique_chars == 26


if __name__ == "__main__":
    cases = int(raw_input())
    for i in range(cases):
        test = raw_input()
        balanced = isBalancedString(test)
        if balanced:
            print "Yes"
        else:
            print "No"