Pangram

I - Pangram

Time Limit:2000MS     Memory Limit:262144KB     64bit IO Format:%I64d & %I64u

Submit Status

Description

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 Input

Input

12toosmallword

Output

NO

Input

35TheQuickBrownFoxJumpsOverTheLazyDog

Output

YES

#include<iostream>#include<string.h>using namespace std;int main(){int n,count[26],lena,i,j,flag=0;char a[120];memset(count,0,sizeof(count));cin>>n;cin>>a;strupr(a);if(n<26)cout<<"NO"<<endl;else{        lena=strlen(a);for(i=0;i<lena;i++){for(j=0;j<=25;j++){if(a[i]=='A'+j){count[j]++;break;}}}for(i=0;i<=25;i++){   if(count[i]==0)   {   flag=1;   cout<<"NO"<<endl;   break;   }   }if(!flag)cout<<"YES"<<endl;}return 0;}