CF Pangram

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


题意为判断这句话里是否26个字母都出现过，没什么好说的。

#include <iostream>
#include <cstring>
#include <cstdio>
#include <string>
#include <algorithm>
#include <cctype>
#include <queue>
using    namespace    std;

int    main(void)
{
    char    s[105];
    bool    vis[26] = {false};
    int    n;

    scanf("%d",&n);
    scanf("%s",s);
    for(int i = 0;s[i];i ++)
        if(isupper(s[i]))
            vis[s[i] - 'A'] = true;
        else
            vis[s[i] - 'a'] = true;
    
    for(int i = 0;i < 26;i ++)
        if(!vis[i])
        {
            puts("NO");
            return    0;
        }
    puts("YES");
    return    0;
}