Isogram Checker

An isogram is a word in which no letter occurs more than once. Your task is to determine whether a given string is an isogram. The check should be case-insensitive, i.e. letters in uppercase and lowercase are considered the same.

For example, the word machine is an isogram because no letter repeats, while programming is not an isogram since the letter 'r' and 'g' appear more than once.

Note: An empty string is considered an isogram.

You are to read multiple test cases from standard input and output the result for each case.

inputFormat

The input begins with an integer T (1 ≤ T ≤ 100), denoting the number of test cases. Each of the following T lines contains a string S which you need to check.

The string S may consist of alphabetic characters and can be empty.

outputFormat

For each test case, output a single line containing "YES" if the string is an isogram, and "NO" otherwise.

## sample

3
machine
isogram
programming

YES
YES
NO

</p>