#C1595. Pangram Checker

    ID: 44817 Type: Default 1000ms 256MiB

Pangram Checker

Pangram Checker

Given a string s containing lowercase alphabets and spaces, determine if it is a pangram. In other words, the string should contain every letter of the English alphabet at least once. Recall that the English alphabet is \(\{a, b, c, \dots, z\}\).

Your task is to read the input string from standard input and output YES if the string is a pangram, and NO otherwise.

inputFormat

The input consists of a single line containing a string s that includes lowercase letters and spaces.

outputFormat

Output a single line with either YES if the string is a pangram, or NO otherwise.

## sample
the quick brown fox jumps over the lazy dog
YES