Skip to content
UPEEC

Pangram

Easy#strings#hashing· solved by 0 · time limit 2.0 s

A pangram uses every letter of the English alphabet at least once. Print Yes or No.

Input

One line of text.

Output

Yes or No.

Constraints

1 to 1000 characters.

Sample 1

Input

The quick brown fox jumps over the lazy dog

Output

Yes

Sample 2

Input

Hello world

Output

No

Sign in or join free to run and submit your solution.