Is the Sentence a Pangram?

Ninja is relocating to a place called NinjaGram, and for school admission, he is required to identify if a given sentence is a pangram. Your task is to assist Ninja in determining if the sentence meets the pangram criteria.

A sentence is defined as a pangram if it includes every letter of the English alphabet at least once.

Input:

The first line contains an integer 'T', the number of test cases.
Each test case is comprised of two lines:
- An integer 'n', representing the number of characters in the sentence.
- A string that can contain both uppercase and lowercase letters.

Output:

For each test case, output “YES” if the sentence is a pangram, otherwise output “NO”.
Output each result on a new line corresponding to each test case.

Example:

Input:
2
35
The quick brown fox jumps over the lazy dog
20
Hello world

Output:
YES
NO

Constraints:

• 1 <= T <= 50
• 1 <= n <= 10^4

Note: The function implementation is required; the printing of the output is already handled.