Problem: 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

12
toosmallword


Output

NO


Input

35
TheQuickBrownFoxJumpsOverTheLazyDog


Output

YES

Solution (in PYTHON3):

Solution:
# A Python Program to check if the given 
# string is a pangram or not 

def checkPangram(s): 
	List = [] 
	# create list of 26 charecters and set false each entry 
	for i in range(26): 
		List.append(False) 
		
	#converting the sentence to lowercase and iterating 
	# over the sentence 
	for c in s.lower(): 
		if not c == " ": 
			# make the corresponding entry True 
			List[ord(c) -ord('a')]=True
			
	#check if any charecter is missing then return False 
	for ch in List: 
		if ch == False: 
			return False
	return True

# Driver Program to test above functions
n=int(input())
sentence =input()

if (checkPangram(sentence)): 
	print("YES")
else: 
	print("NO")