Pangram Checker

A pangram is a sentence that contains every letter of the English alphabet at least once, regardless of the case. Your task is to check if a given string is a pangram.

For example, the sentence "The quick brown fox jumps over a lazy dog" is a pangram because it contains all 26 letters of the alphabet. In mathematical terms, if we denote the set of lowercase English letters by \( \mathcal{A} = \{a, b, c, \dots, z\} \), then a string \( s \) is a pangram if:

\( \mathcal{A} \subseteq \{\text{lower}(c) : c \in s\} \)

Print True if the string is a pangram and False otherwise.

inputFormat

The input is read from stdin as a single line containing a string \( s \) which may include letters (both uppercase and lowercase), spaces, digits, and punctuation.

outputFormat

Output to stdout a single line: True if the input string is a pangram, otherwise False.

## sample

The quick brown fox jumps over a lazy dog

True

</p>