Pangram Checker

No attempts yetTime limit3sMemory limit256 MB

Problem

A pangram uses every English letter at least once. A double pangram uses each letter at least twice, and a triple pangram at least three times. Classify each given sentence.

Input

The first line contains the number of test cases nn. Each of the next nn lines is a sentence with English letters and punctuation.

Output

For each case, print Case i: followed by Not a pangram, Pangram!, Double pangram!!, or Triple pangram!!!. Print only the highest matching grade.