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

Difficulty: interview

Starter code:

Solutions:
n = int(input())
s = input()
a = [False for i in range(26)]
for x in s:
    a[ord(x.lower()) - ord('a')] = True
for x in a:
    if not x:
        print('NO')
        return
print('YES')


n = int(input())
s = input()

mySet = set()
for c in s:
    mySet.add(c.lower())
    
if len(mySet) == 26:
    print("YES")
else:
    print("NO")

import string
f = lambda: input()
n = int(f())

s = f().lower()

ret = True

for c in string.ascii_lowercase:
    if not c in s:
        ret = False
        break

if ret:
    print("YES")
else:
    print("NO")


n = int(input())
my_str = input().upper()
alphabet = "QWERTYUIOPASDFGHJKLZXCVBNM"
i = 0
while i<26 and alphabet[i] in my_str:
    i += 1
if i==26:
    print ("YES")
else:
    print ("NO")

alth = "abcdefghijklmnopqrstuvwxyz"
alth2 = "ABCDEFGHIJKLMNOPQRSTUVWXYZ"
n = int(input())
t = input()
num3 = [0]*26
for i in t:
    if alth.find(i)!= -1:
        num3[alth.find(i)] = 1
    elif alth2.find(i)!= -1:
        num3[alth2.find(i)] = 1 
if sum(num3) == 26:
    print("YES")
else:
    print("NO")




nums = int(input())
the_str = str(input()).lower()
d = set()

for ch in the_str:
    if ch >= 'a' and ch <= 'z':
        d.add(ch)

if(len(d) == 26):
    print("YES")
else:
    print("NO")


input()
s = input()
s = s.lower()
all = set()
for i in s:
    all.add(i)
if len(all) == 26:
    print("YES")
else:
    print("NO")

class A:
    def A(self, n, s):
        alphabets = ['A', 'B', 'C', 'D', 'E', 'F', 'G',
                     'H', 'I', 'J', 'K', 'L', 'M', 'N', 'O', 'P', 'Q', 'R', 'S', 'T',
                     'U', 'V', 'W', 'X', 'Y', 'Z']
        s = s.upper()
        for i in  alphabets:
            if i not in s:
                return "NO"
        return "YES"

def __starting_point():
    n = int(input())
    s = input()
    print(A().A(n,s))
__starting_point()

rng = int(input())
instr = list(input().lower())

chars = []
for i in range(26):
    chars.append(0)

for char in range(rng):
    chars[ord(instr[char])-97] += 1

isyes = True
for i in range(26):
    if chars[i] == 0:
        print('NO')
        isyes = False
        break

if isyes:
    print('YES')


n = int(input())
a = input()
k = 1
a = a.lower()
for i in range(97,123):
    if a.count(chr(i)) == 0:
        k=0
        break
if k:
    print("YES")
else:
    print("NO")

def Main():
    num = input()
    str = list(input().lower())
    str.sort()
    str = "".join(str)
    
    for word in range (97, 123):
        symb = chr(word)
        if str.find(symb) == -1:
            print("NO")
            return
    
    print ("YES")
    return

    
def __starting_point():
    Main()
__starting_point()

A = [0] * 26
n = int(input())
s = list(input().lower())
for i in s:
    A[ord(i) - ord('a')] += 1
res = 'YES'
for i in A:
    if i == 0:
        res = 'NO'    
print(res)

n=int(input());
s=input()

a=[ord(c) for c in s]

for i in range (0,n):
    if a[i]>96:
        a[i]=a[i]-32
        
counter=0;
for i in range (65,91):
    
    for j in range (0,n):
        if a[j]== i:
            counter=counter+1
            break
        
if counter==26:
    print("YES")
else:
    print("NO")


import string

n = int(input())
s = input()
cnt = set()
for i in s.lower(): cnt.add(i)
cnt = frozenset(cnt)
print(('NO', 'YES')[cnt == frozenset(string.ascii_lowercase)])


def ok(x):
    x = x.lower()
    for i in 'abcdefghijklmnopqrstuvwxyz':
        if i.lower() not in x:
            return False
    return True

a = int(input())
b = input()
if ok(b):
    print("YES")
else:
    print("NO")


import sys
l=int(sys.stdin.readline())
n=list(sys.stdin.readline())
a=[0]*26
for i in n[:-1]:
  j=ord(i)
  if j >91:  j=j-32
  j=j-65
  a[j]=1
  if sum(a)==26:
    print("YES")
    break
if sum(a)!=26:  print("NO")

input()
s = input()

all_el = set()

for i in range(len(s)):
    all_el.add(s[i].lower())



if(26 == len(all_el)):
    print("YES")
else:
    print("NO")

input()
print('YES' if len(set(list(input().lower())))==26 else 'NO')

n = int(input())
str = input().lower()
x = [0] * 50
for i in range(n) :
    x[ord(str[i]) - ord('a')] = 1
cou = 0
for i in range(26) :
    cou += x[i]
if cou >= 26:
    print('YES')
else :
    print('NO')

n = int(input())
s = input()
ss = len(set(s.lower()))
if ss >= 26:
	print('YES')
else :
	print('NO')

import string
input()
p = input()
print(["NO", "YES"][all(l in p.lower() for l in string.ascii_lowercase)])