A typing school records each student's practice drill as a single line of lowercase words separated by single spaces. An instructor calls a drill line a complete alphabet drill if, once the spaces are ignored, every one of the 26 lowercase English letters appears somewhere in the line at least once. Given one drill line, determine whether it is a complete alphabet drill.

Input format

A single line containing the drill line: lowercase English letters and single spaces only, with no leading or trailing spaces and no two consecutive spaces.

Output format

Print true if the drill line contains every letter from a to z at least once, otherwise print false.

Constraints

• 1 <= length of the line <= 1000
• The line contains only lowercase English letters (a-z) and the space character.
• There is no leading or trailing space, and no two consecutive spaces.

thequickbrownfoxjumpsoverthelazydog

true

practice makes perfect

false