a = input().lower()[:-1]
a = a.replace(" ", "")
arr = ['a','e','i','o','u','y']
print('YES' if a[-1:] in arr else 'NO')#include "bits/stdc++.h"
using namespace std;
int main() {
// 30.
string s = "";
getline(cin, s);
int m = s.size();
int i = m - 1;
while(i >= 0) {
if(s[i] >= 'a' && s[i] <= 'z' || s[i] >= 'A' && s[i] <= 'Z') {
break;
}
--i;
}
char c = s[i];
if(c == 'a' || c == 'e' || c == 'i' || c == 'o' || c == 'u' || c == 'y' ||
c == 'A' || c == 'E' || c == 'I' || c == 'O' || c == 'U' ||
c == 'Y') {
cout << "YES" << endl;
}
else cout << "NO" << endl;
return 0;
}Split houses | Divisible |
Three primes | Coprimes |
Cost of balloons | One String No Trouble |
Help Jarvis! | Lift queries |
Goki and his breakup | Ali and Helping innocent people |
Book of Potion making | Duration |
Birthday Party | e-maze-in |
Bricks Game | Char Sum |
Two Strings | Anagrams |
Prime Number | Lexical Sorting Reloaded |
1514A - Perfectly Imperfect Array | 580A- Kefa and First Steps |
1472B- Fair Division | 996A - Hit the Lottery |
MSNSADM1 Football | MATCHES Playing with Matches |
HRDSEQ Hard Sequence | DRCHEF Doctor Chef |
559. Maximum Depth of N-ary Tree | 821. Shortest Distance to a Character |