Pangram Checker

You are given a string s. Your task is to determine whether s is a pangram or not. A pangram is a sentence that contains every letter of the Latin alphabet at least once. The comparison is case-insensitive, so uppercase and lowercase letters are considered the same. In mathematical terms, the string is a pangram if for every letter \(a \ldots z\), there exists at least one occurrence in s.

inputFormat

The input consists of a single string that may contain spaces, punctuation, numbers, and other symbols. The string is read from the standard input (stdin).

outputFormat

Output a single line: True if the input string is a pangram, and False otherwise. The output should be written to standard output (stdout).

The quick brown fox jumps over the lazy dog

True