Check if String Contains Every Letter of the Alphabet

Given a string, determine if it contains every letter of the English alphabet at least once. The check should be case-insensitive, meaning that letters in either upper-case or lower-case should be counted towards the alphabet. The task is commonly related to the concept of a pangram, which is a sentence containing all the letters of the alphabet.

For example, the sentence "The quick brown fox jumps over the lazy dog" is a pangram because it uses every letter. Your solution should read the input from standard input (stdin) and print the result to standard output (stdout) as either True or False (without quotes).

Note: Use LaTeX for any formulas if needed. In this problem, the set of letters can be represented as \( \{a,b,c,\dots,z\} \).

inputFormat

The input consists of a single string, which may contain letters, digits, spaces, and punctuation. Read the entire input from standard input.

outputFormat

Output True if the string contains every letter from \(a\) to \(z\) at least once (ignoring case), otherwise output False.

The quick brown fox jumps over the lazy dog

True