Pangram Checker

Given a sentence, your task is to determine whether it is a pangram or not. A pangram is a sentence that contains every letter of the English alphabet at least once. In mathematical terms, let \(S\) be the set of alphabetic characters in the sentence (ignoring case). The sentence is a pangram if and only if \(|S| = 26\).

For example, the sentence "The quick brown fox jumps over the lazy dog" is a pangram because it contains every letter from a to z, while "Hello World" is not.

inputFormat

The input consists of a single line containing a sentence. The sentence may include letters, digits, spaces, and punctuation.

outputFormat

Output a single line containing True if the sentence is a pangram, and False otherwise.

The quick brown fox jumps over the lazy dog

True