Pangram Checker

Given a string, determine whether it is a pangram. A pangram is a sentence that contains every letter of the English alphabet at least once. The problem requires checking whether the input string uses each of the 26 letters of the Latin alphabet. For example, the sentence The quick brown fox jumps over the lazy dog is a pangram. Use efficient techniques to solve the problem.

inputFormat

The input is read from standard input (stdin) and consists of a single line containing a string s. The string may include letters, spaces, digits, and punctuation.

outputFormat

The output should be printed to standard output (stdout) and will be a single line containing either pangram if the string includes every letter of the English alphabet at least once, or not pangram otherwise.

The quick brown fox jumps over the lazy dog

pangram