human
I found an interesting problem on https://codeforces.com/problemset/problem/520/A:
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

I tried it in Python, but could not do it. Can you solve it?

 ... Write me a the Python code you requested?
assistant
#Here is the Python code you requested.

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()