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 CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
const constexpr int INF = 1e9;
const constexpr long long MOD = 1e9 + 7;
const int BITSIZE = 100010;
struct Less {
  bool operator()(const pair<int, int>& x, const pair<int, int>& y) const {
    return x.second < y.second;
  }
};
struct More {
  bool operator()(const pair<int, int>& x, const pair<int, int>& y) const {
    return x.first > y.first;
  }
};
int bit[100010];
int bit_query(int i) {
  int res = 0;
  for (; i >= 1; i -= i & -i) res = max(res, bit[i]);
  return res;
}
void bit_set(int x, int v) {
  for (; x <= BITSIZE; x += x & -x) {
    bit[x] = max(bit[x], v);
  }
}
int a[1010];
int main() {
  int n;
  cin >> n;
  string s;
  cin >> s;
  for (int i = 0; i < n; ++i) a[s[i] - 'A']++;
  bool f = true;
  for (int i = 0; i < 26; ++i) {
    if (a[i] || a[i + 32])
      continue;
    else
      f = false;
  }
  if (f)
    cout << "YES" << endl;
  else
    cout << "NO" << endl;
  return 0;
}