Description

Write a Java program that identifies pair isograms. An isogram is a word without a repeating letter. Example isograms are palindromes, incomputable, and computerizably. A pair isogram is a word where each letter appears exactly twice. Example pair isograms are teammate, intestines, and noon.

Input

The first input line will be a positive integer n, indicating the number of words to be processed. Each of the following n input lines contains a word.

Output

Print each input word along with a message indicating whether or not it is pair isograms. Follow the format illustrated in Sample Output. The input word may contain uppercase, lowercase, and punctuation, which you shall ignore in determining whether the word is a pair isogram. For examples, Shannah's and Hello.O'he are a pair isograms.

Sample Input

3 teammate ali dood 

Sample Output

teammate --- pair isogram ali --- not pair isogram dood --- pair isogram 

Additional Information

You should use a Scanner to read the input values.

Do not prompt for input. The input will be there.

You should use System.out.println() to generate your output.

The output line has to match exactly.