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.
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.
[10/11, 2:38 PM] Nisha: # Input the number of test cases
T = int(input())

# Process each test case
for _ in range(T):
    # Read the input string
    s = input()
    
    # Initialize a set to store seen characters
    seen = set()
    
    # Iterate through the string
    for char in s:
        # If the character is already in the set, it's a repeating character
        if char in seen:
            print(char)
            break
        else:
            seen.add(char)
    else:
        # If the loop completes without finding a repeating character, print '.'
        print('.')
[10/11, 2:40 PM] Rani Raj: n = int(input())
input_string = input().lower()
unique_letters = set()

for char in input_string:
    if 'a' <= char <= 'z':
        unique_letters.add(char)
if len(unique_letters) == 26:
    print("YES")
else:
    print("NO")
  		  					 			 		 		 		   			