Pangram

题意翻译

如果一个字符串包含了所有的字符(a到z,不区分大小写),那么我们就说这是一个神奇的字符串。 现在,给你一个由大写和小写字母组成的字符串,判断其是否为神奇的字符串。 第一行包含一个整数n(1≤n≤100)表示字符串的长度。 第二行包含字符串,该字符串只包含大写和小写字母。 如果是神奇的字符串,就输出YES,否则输出NO。 By @馒头精

题目描述

A word or a sentence in some language is called a pangram if all the characters of the alphabet of this language appear in it at least once. Pangrams are often used to demonstrate fonts in printing or test the output devices. You are given a string consisting of lowercase and uppercase Latin letters. Check whether this string is a pangram. We say that the string contains a letter of the Latin alphabet if this letter occurs in the string in uppercase or lowercase.

输入输出格式

输入格式


The first line contains a single integer $ n $ ( $ 1<=n<=100 $ ) — the number of characters in the string. The second line contains the string. The string consists only of uppercase and lowercase Latin letters.

输出格式


Output "YES", if the string is a pangram and "NO" otherwise.

输入输出样例

输入样例 #1

12
toosmallword

输出样例 #1

NO

输入样例 #2

35
TheQuickBrownFoxJumpsOverTheLazyDog

输出样例 #2

YES