123

最新推荐文章于 2021-06-08 10:35:25 发布

渔舟唱晚，雁阵惊寒

最新推荐文章于 2021-06-08 10:35:25 发布

阅读量1w

点赞数

CC 4.0 BY-SA版权

本文链接：https://blog.csdn.net/xuezy3550618/article/details/46876689

A. Pangram

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

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.

Input

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

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

        Sample test(s) 
      
          input 
        
12
toosmallword

          output 
        
NO

          input 
        
35
TheQuickBrownFoxJumpsOverTheLazyDog

          output 
        
YES