Problem: Vasya plays the sleuth with his friends. The rules of the game are as follows: those who play for the first time, that is Vasya is the sleuth, he should investigate a "crime" and find out what is happening. He can ask any questions whatsoever that can be answered with "Yes" or "No". All the rest agree beforehand to answer the questions like that: if the question’s last letter is a vowel, they answer "Yes" and if the last letter is a consonant, they answer "No". Of course, the sleuth knows nothing about it and his task is to understand that.

Unfortunately, Vasya is not very smart. After 5 hours of endless stupid questions everybody except Vasya got bored. That’s why Vasya’s friends ask you to write a program that would give answers instead of them.

The English alphabet vowels are: A, E, I, O, U, Y

The English alphabet consonants are: B, C, D, F, G, H, J, K, L, M, N, P, Q, R, S, T, V, W, X, Z

Input

The single line contains a question represented by a non-empty line consisting of large and small Latin letters, spaces and a question mark. The line length does not exceed 100. It is guaranteed that the question mark occurs exactly once in the line — as the last symbol and that the line contains at least one letter.

Output

Print answer for the question in a single line: YES if the answer is "Yes", NO if the answer is "No".

Remember that in the reply to the question the last letter, not the last character counts. I. e. the spaces and the question mark do not count as letters.

Examples

Input

Is it a melon?


Output

NO


Input

Is it an apple?


Output

YES


Input

  Is     it a banana ?


Output

YES


Input

Is   it an apple  and a  banana   simultaneouSLY?


Output

YES

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
long long powoftwonumber(long long, long long);
long long sumofprimenumber(long long);
long long power(long long, long long);
int32_t main() {
  string s;
  getline(cin, s);
  long long l = s.size();
  l = l - 1;
  long long i;
  for (i = l; i > -1; i--) {
    if ((s[i] >= 'A' && s[i] <= 'Z') || (s[i] >= 'a' && s[i] <= 'z')) {
      break;
    }
  }
  l = i;
  if (s[l] == 'a' || s[l] == 'e' || s[l] == 'i' || s[l] == 'o' || s[l] == 'u' ||
      s[l] == 'y' || s[l] == 'A' || s[l] == 'E' || s[l] == 'I' || s[l] == 'O' ||
      s[l] == 'U' || s[l] == 'Y') {
    cout << "YES"
         << "\n";
  } else {
    cout << "NO"
         << "\n";
  }
  return 0;
}
long long sumofprimenumber(long long N) {
  long long i, Number, count, s = 0;
  for (Number = 2; Number <= N; Number++) {
    count = 0;
    for (i = 2; i <= sqrt(Number); i++) {
      if (Number % i == 0) {
        count++;
        break;
      }
    }
    if (count == 0) {
      s = s + Number;
    }
  }
  return s;
}
long long powoftwonumber(long long a, long long b) {
  long long res = 1;
  while (b > 0) {
    if ((b & 1) != 0) {
      res = (res % 1000000007 * a % 1000000007) % 1000000007;
    }
    a = (a % 1000000007 * a % 1000000007) % 1000000007;
    b = b >> 1;
  }
  return res;
}
long long power(long long x, unsigned long long y) {
  long long res = 1;
  x = x % 1000000007;
  if (x == 0) return 0;
  while (y > 0) {
    if (y & 1) res = (res * x) % 1000000007;
    y = y >> 1;
    x = (x * x) % 1000000007;
  }
  return res;
}