Problem Description

Takahashi has come to a drink bar. He is in the mood for drinking tea now. However, all the drink labels at the bar are written in Roman letters, and Takahashi cannot read them. Takahashi wants to know if a certain drink is tea or not. A drink is considered tea if its Roman letter label ends with the letter T.

Your task is to write a program that determines whether a given Roman letter string $ S $ representing a drink is tea.

Input Format

The input is given from the standard input in the following format:

$ S $

Output Format

Output YES if the drink represented by the string $ S $ is tea, otherwise output NO in one line.

Sample Input and Output

Sample Input #1

ICEDT

Sample Output #1

YES

Sample Input #2

MUGICHA

Sample Output #2

NO

Sample Input #3

OOLONGT

Sample Output #3

YES

Sample Input #4

T

Sample Output #4

YES

Sample Input #5

TEA

Sample Output #5

NO

Notes/Hints

Constraints

• The length of $ S $ is between $ 1 $ and $ 50 $ inclusive.
• Each character in $ S $ is an uppercase English letter.

Sample Explanation 1

ICEDT is a string that ends with T, so output YES.

Sample Explanation 2

Only strings ending with T are considered tea.

见题面 Input 部分

见题面 Output 部分