#K6576. Pangram Checker

    ID: 32269 Type: Default 1000ms 256MiB

Pangram Checker

Pangram Checker

Given a sentence, 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 notation, the alphabet is given by \(\{a, b, c, \dots, z\}\).

Your task is to read a sentence from standard input (stdin) and output whether it is a pangram. The answer should be True if the sentence is a pangram, and False otherwise.

inputFormat

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

outputFormat

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

## sample
The quick brown fox jumps over the lazy dog
True