Pangram Checker

Given a sentence, determine whether it is a pangram. A pangram is a sentence that contains every letter of the English alphabet at least once. In mathematical terms, a sentence \(S\) is a pangram if for every letter \(c \in \{a, b, \ldots, z\}\), there exists an index \(i\) such that \(S[i] = c\). Note that the evaluation is case-insensitive, and punctuation and spaces should be ignored.

inputFormat

The input consists of a single line containing the sentence to be checked.

outputFormat

Output YES if the sentence is a pangram; otherwise, output NO.

The quick brown fox jumps over the lazy dog!

YES