Codeforces 520 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.

Examples

input

Copy

12
toosmallword

output

Copy

NO

input

Copy

35
TheQuickBrownFoxJumpsOverTheLazyDog

output

Copy

YES

思路:意思大概就是第一行给定你一个数n，接下来的一行有n个字符组成的一个字符串，问是否a~z这26个字母均出现（大小写都算）。我的代码如下：

#include<stdio.h>
#include<string.h>
#include<iostream>
#include<algorithm>
using namespace std;
int main(){
	int n,i;
	cin>>n;
	char a[102],b[102];
	cin>>a;
	int l=strlen(a);
	for(i=0;i<l;i++)
	{
		if(a[i]<=90)
		 a[i]=a[i]+32;
	}
	sort(a,a+l);
	int k=0;
	for(i=0;i<l;i++)
	{
		if(a[i]!=a[i+1])
		b[k++]=a[i];
	}
       //int k=unique(a,a+l)-a;当然可以直接这样写
	if(k==26)
	  cout<<"YES"<<endl;
	else
	  cout<<"NO"<<endl;
	return 0;	
}